Skip to search formSkip to main contentSkip to account menu

Simply typed lambda calculus

Known as: Bidirectional type checking, Simply typed λ-calculus, STLC 
The simply typed lambda calculus (), a formof type theory, is a typed interpretation of the lambda calculus with only one type constructor: that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended… 
2007
2007
. We investigate, in a categorical setting, some completeness properties of beta-eta conversion between closed terms of the… 
2007
2007
In this paper we present a translation from the simply typed lambda calculus into an extended simply typed lambda calculus that… 
2006
2006
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem… 
2005
2005
We consider a class of terms in the simply typed lambda calculus in which initially, during reduction, and for the potential… 
2002
2002
2000
2000
Note: Also in: Novi Sad J. Math. 31 (2001), no. 1, 27--32 Reference LARA-CONF-2000-001 Record created on 2007-08-21, modified on… 
Review
1998
Review
1998
The purpose of this course is to provide an introduction to λ-calculi, specifically the simply typed lambda calculus… 
1995
1995
We investigate, in a categorical setting, some completeness properties of beta-eta conversion between closed terms of the…