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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
Gradual typing is an approach to integrating static and dynamic type checking within the same language [Siek and Taha 2006… (More)
Is this relevant?
Review
2008
Review
2008
Intersection types are well known to type theorists mainly for two reasons. Firstly, they type all and only the strongly… (More)
  • table 2
Is this relevant?
2002
2002
This paper studies normalisation by evaluation for typed lambda calculus from a categorical and algebraic viewpoint. The first… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper, we develop a system of typed lambda-calculus for the Zermelo-Frænkel set theory, in the framework of classical… (More)
Is this relevant?
2000
2000
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather… (More)
Is this relevant?
1996
1996
In this paper, we present an explicitly typed version of the Lambda Calculus of Objects of [7], which is a development of the… (More)
Is this relevant?
1994
1994
! There are many variants of the lambda calculus. The typed lambda calculus decorates terms with type annotations: 
Is this relevant?
1993
1993
Given a model of the polymorphic typed lambda calculus based upon a Cartesian closed category K, there will be functors from K to… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Much research has been devoted in building computer systems for checking proofs or for developing interactively correct proofs in… (More)
Is this relevant?
1991
1991
1.1. Lambda calculus is not intended to be just a formal game: it was created with the intent to represent operations with… (More)
Is this relevant?