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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

When presenting logical systems and type theories, it is common to write finite lists of things using a comma to indicate the…

Review

2015

Review

2015

This manuscript takes a critical look at the contemporary state and direction of sedation for the pediatric dental patient from…

2007

It is a common knowledge that the integer functions definable in simply typed lambda-calculus are exactly the extended…

2007

In this paper we present a translation from the simply typed lambda calculus into an extended simply typed lambda calculus that…

2002

2001

We present a Theory of Specifications based on Martin-Löf's type theory, with rules for simultaneously constructing programs and…

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…

1999

1999

We address the problem of complementing higher-order patterns without repetitions of free variables. Di erently from the rst…

1996

We develop a higher-order unification algorithm for a restricted class of simply typed lambda terms with function space and…