Results 1  10
of
120,116
About Typed Algebraic Lambdacalculi
"... Arrighi and Dowek (2008) introduce an untyped lambdacalculus together with a structure of module over a ring of scalars. They show that diverging terms may break confluence if a naive rewriting system is used. In this paper, we explore the semantics of a typed version of their language. First, we ..."
Abstract
 Add to MetaCart
Arrighi and Dowek (2008) introduce an untyped lambdacalculus together with a structure of module over a ring of scalars. They show that diverging terms may break confluence if a naive rewriting system is used. In this paper, we explore the semantics of a typed version of their language. First
in Typed LambdaCalculi
"... in Typed LambdaCalculiThèse de doctorat de l’université de Toulouse III Paul Sabatier ..."
Abstract
 Add to MetaCart
in Typed LambdaCalculiThèse de doctorat de l’université de Toulouse III Paul Sabatier
Continuation Semantics in Typed LambdaCalculi
 Logics of Programs
, 1985
"... . This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambdacalculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values, but ..."
Abstract

Cited by 75 (2 self)
 Add to MetaCart
. This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambdacalculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values
Undecidability of typechecking in domainfree typed lambdacalculi with existence
 In the 17th EACSL Annual Conference on Computer Science Logic (CSL 2008), LNCS 5213
, 2008
"... Abstract. This paper shows undecidability of typechecking and typeinference problems in domainfree typed lambdacalculi with existential types: a negation and conjunction fragment, and an implicational fragment. These are proved by reducing typechecking and typeinference problems of the domainf ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. This paper shows undecidability of typechecking and typeinference problems in domainfree typed lambdacalculi with existential types: a negation and conjunction fragment, and an implicational fragment. These are proved by reducing typechecking and typeinference problems of the domain
LabelSelective LambdaCalculi and Transformation Calculi
, 1994
"... The labelselective lambdacalculus, in its different variants, and its offspring, the transformation calculus, are the results of a research on the role of Currying in the lambda calculus. Currying is the simple trick by which functions of multiple arguments can be written in the lambda calculus, w ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The labelselective lambdacalculus, in its different variants, and its offspring, the transformation calculus, are the results of a research on the role of Currying in the lambda calculus. Currying is the simple trick by which functions of multiple arguments can be written in the lambda calculus
LabelSelective LambdaCalculi And Transformation Calculi
, 1994
"... The labelselective lambdacalculus, in its different variants, and its offspring, the transformation calculus, are the results of a research on the role of Currying in the lambda calculus. Currying is the simple trick by which functions of multiple arguments can be written in the lambda calculus, w ..."
Abstract
 Add to MetaCart
The labelselective lambdacalculus, in its different variants, and its offspring, the transformation calculus, are the results of a research on the role of Currying in the lambda calculus. Currying is the simple trick by which functions of multiple arguments can be written in the lambda calculus
Complete Lax Logical Relations for Cryptographic LambdaCalculi
 In Proceedings of CSL’2004, volume 3210 of LNCS
, 2004
"... Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equivalence in typed lambda calculi, see e.g. Sumii and Pierce's logical relation for a cryptographic lambdacalculus. We clarify Su ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equivalence in typed lambda calculi, see e.g. Sumii and Pierce's logical relation for a cryptographic lambdacalculus. We clarify
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Programming in HigherOrder Typed LambdaCalculi
, 1989
"... on Foundations of Computer Science, pages 279282, IEEE, October 1988. [55] J. SteensgaardMadsen. Typed representation of objects by functions. ACM Transactions on Programming Languages and Systems, 11(1):6789, January 1989. 71 [31] [33] [34] [35] Grard Huet. A unification algorithm for ty ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
on Foundations of Computer Science, pages 279282, IEEE, October 1988. [55] J. SteensgaardMadsen. Typed representation of objects by functions. ACM Transactions on Programming Languages and Systems, 11(1):6789, January 1989. 71 [31] [33] [34] [35] Grard Huet. A unification algorithm
Results 1  10
of
120,116