A simple type system for combinatory logic gives combinators one type each, with polymorphism revealed by application, supporting more polymorphism than Hindley-Milner without quantified types and including type inference.
Liquid types
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
LLMs can generate natural language specs and perform compositional verification to help prevent vulnerable code from being produced by AI models.
citing papers explorer
-
Simple Types for Polymorphic Functions
A simple type system for combinatory logic gives combinators one type each, with polymorphism revealed by application, supporting more polymorphism than Hindley-Milner without quantified types and including type inference.
-
Natural Language based Specification and Verification
LLMs can generate natural language specs and perform compositional verification to help prevent vulnerable code from being produced by AI models.