Results 1  10
of
213,679
Telescopic mappings in typed lambda calculus
 Information and Computation
, 1991
"... The paper develops notation for strings of abstracters in typed lambda calculus, and shows how to treat them more or less as single abstracters. 0 1991 Academic Press. Inc. 1. ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
The paper develops notation for strings of abstracters in typed lambda calculus, and shows how to treat them more or less as single abstracters. 0 1991 Academic Press. Inc. 1.
Notes on simply typed lambda calculus
, 1998
"... The purpose of this course is to provide an introduction to λcalculi, specifically the simply typed lambda calculus (λ →). λcalculi are formalisms that are useful in computer science. They are languages that express both computational and logical information. Computational information in that they ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
The purpose of this course is to provide an introduction to λcalculi, specifically the simply typed lambda calculus (λ →). λcalculi are formalisms that are useful in computer science. They are languages that express both computational and logical information. Computational information
Natural Deduction And Sequent Typed Lambda Calculus
, 1999
"... Two different formulations of the simply typed lambda calculus: the natural deduction and the sequent system, are considered. An analogue of cut elimination is proved for the sequent lambda calculus. ..."
Abstract
 Add to MetaCart
Two different formulations of the simply typed lambda calculus: the natural deduction and the sequent system, are considered. An analogue of cut elimination is proved for the sequent lambda calculus.
A typed lambda calculus with categorical type constructors
 In Category Theory in Computer Science
, 1987
"... A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals o ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals
Proof Systems for Retracts in Simply Typed Lambda Calculus
"... Abstract. This paper concerns retracts in simply typed lambda calculus assuming βηequality. We provide a simple tableau proof system which characterises when a type is a retract of another type and which leads to an exponential decision procedure. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This paper concerns retracts in simply typed lambda calculus assuming βηequality. We provide a simple tableau proof system which characterises when a type is a retract of another type and which leads to an exponential decision procedure. 1
Reducibility of Types in Typed Lambda Calculus*
"... The following full text is a preprint version which may differ from the publisher's version. ..."
Abstract
 Add to MetaCart
The following full text is a preprint version which may differ from the publisher's version.
Normalization by evaluation for typed lambda calculus with coproducts
 In LICS
, 2001
"... We solve the decision problem for simply typed lambda calculus with strong binary sums, equivalently the word problem for free cartesian closed categories with binary coproducts. Our method is based on the semantical technique known as “normalization by evaluation ” and involves inverting the interp ..."
Abstract

Cited by 46 (6 self)
 Add to MetaCart
We solve the decision problem for simply typed lambda calculus with strong binary sums, equivalently the word problem for free cartesian closed categories with binary coproducts. Our method is based on the semantical technique known as “normalization by evaluation ” and involves inverting
Notes on the Simply Typed Lambda Calculus
, 1998
"... Contents 1 Deduction 11 1.1 Inference Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.1.1 The Definition . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.1.2 Adding extra axioms . . . . . . . . . . . . . . . . . . . . . . . 12 1.1.3 Semantics for Inference System ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
style formal system, H . . . . . . . . . . . . . . . . 14 1.2.2 Natural Deduction . . . . . . . . . . . . . . . . . . . . . . . . 15 1.2.3 Sequent Formulation, ND, of Natural Deduction . . . . . . . 17 1.2.4 Normal ND treeproofs . . . . . . . . . . . . . . . . . . . . . 17 1.2.5 Sequent Calculus SC . . . . . . . . . . . .
A Typed Lambda Calculus of Objects
 In Asian'96, LNCS 1179, 129141
, 1996
"... Abstract. In this paper, we present an explicitly typed version of the Lambda Calculus of Objects of [7], which is a development of the objectcalculi defined in [10, 2]. This calculus supports object extension in presence of object subsumption. Extension is the ability of modify the behavior of an ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. In this paper, we present an explicitly typed version of the Lambda Calculus of Objects of [7], which is a development of the objectcalculi defined in [10, 2]. This calculus supports object extension in presence of object subsumption. Extension is the ability of modify the behavior
The maximality of the typed lambda calculus and of cartesian closed categories
 Publ. Inst. Math. (N.S
"... From the analogue of Böhm’s Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian closed categories must be a preorder. A new proof is given here ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
From the analogue of Böhm’s Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian closed categories must be a preorder. A new proof is given
Results 1  10
of
213,679