Skip to search formSkip to main contentSkip to account menu

Typed lambda calculus

Known as: Typed lambda calculi 
A typed lambda calculus is a typed formalism that uses the lambda-symbol () to denote anonymous function abstraction. In this context, types are… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Programmers often wish to validate or sanitize user input. One common approach to this problem is the use of regular expressions… 
Review
2012
Review
2012
Gradual typing is an approach to integrating static and dynamic type checking within the same language [Siek and Taha 2006… 
2007
2007
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion ? A… 
1998
1998
A miniature multi-impedance transformer module specially adapted for use in telephony. In the preferred embodiment a pair of… 
1994
1994
A typechecker for a typed λ-calculus having implicit arguments is presented. The typechecker works in such a way that the… 
1994
1994
1991
1991
We are concerned with two important issues in simulation modelling: model comprehension and model construction. Model… 
1985
1985
  • J. Lambek
  • 1985
  • Corpus ID: 38456862
Review
1983
Review
1983
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences…