Results 1  10
of
7,651
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
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model. 1 Introduction This paper
Cyclic Lambda Calculi
, 1997
"... . We precisely characterize a class of cyclic lambdagraphs, and then give a sound and complete axiomatization of the terms that represent a given graph. The equational axiom system is an extension of lambda calculus with the letrec construct. In contrast to current theories, which impose restrictio ..."
Abstract

Cited by 44 (5 self)
 Add to MetaCart
. We precisely characterize a class of cyclic lambdagraphs, and then give a sound and complete axiomatization of the terms that represent a given graph. The equational axiom system is an extension of lambda calculus with the letrec construct. In contrast to current theories, which impose
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
, which is essentialy monoargument. The idea is to transform a function on a pair, into a function whose result, once applied to its first argument, must be applied to its second one. That is f (a; b) = (f (a))(b). In our first system, the labelselective lambdacalculus, we give a method to curry
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
, which is essentialy monoargument. The idea is to transform a function on a pair, into a function whose result, once applied to its first argument, must be applied to its second one. That is f (a; b) = (f (a))(b). In our first system, the labelselective lambdacalculus, we give a method to curry
On Coinduction and Quantum Lambda Calculi∗
"... In the ubiquitous presence of linear resources in quantum computation, program equivalence in linear contexts, where programs are used or executed once, is more important than in the classical setting. We introduce a linear contextual equivalence and two notions of bisimilarity, a statebased and a ..."
Abstract
 Add to MetaCart
In the ubiquitous presence of linear resources in quantum computation, program equivalence in linear contexts, where programs are used or executed once, is more important than in the classical setting. We introduce a linear contextual equivalence and two notions of bisimilarity, a statebased and a distributionbased, as proof techniques for reasoning about higherorder quantum programs. Both notions of bisimilarity are sound with respect to the linear contextual equivalence, but only the distributionbased one turns out to be complete. The completeness proof relies on a characterisation of the bisimilarity as a testing equivalence.
Type Assigment Systems for Lambda Calculi and for the Lambda Calculus of Objects
, 1996
"... Data Types and ExistentialTypes : : : : : : : : : : : : : : : : 108 5.2.1 The Existential Model of Pierce and Turner : : : : : : : : : : : : 110 5.2.2 Methods and ObjectTypes : : : : : : : : : : : : : : : : : : : : : 111 5.2.3 Methods and Objects : : : : : : : : : : : : : : : : : : : : : : : : : 1 ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Data Types and ExistentialTypes : : : : : : : : : : : : : : : : 108 5.2.1 The Existential Model of Pierce and Turner : : : : : : : : : : : : 110 5.2.2 Methods and ObjectTypes : : : : : : : : : : : : : : : : : : : : : 111 5.2.3 Methods and Objects
Lambda Calculi and Linear Speedups
 THE ESSENCE OF COMPUTATION: COMPLEXITY, ANALYSIS, TRANSFORMATION, NUMBER 2566 IN LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... The equational theories at the core of most functional programming are variations on the standard lambda calculus. The bestknown of these is the callbyvalue lambda calculus whose core is the valuebeta computation rule (#x.M)V M [ V / x ]whereV is restricted to be a value rather than an arb ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The equational theories at the core of most functional programming are variations on the standard lambda calculus. The bestknown of these is the callbyvalue lambda calculus whose core is the valuebeta computation rule (#x.M)V M [ V / x ]whereV is restricted to be a value rather than
2.2 Simply Typed Lambda Calculi: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6
"... ..."
Lambda calculi and linear speedups
 The essence of computation: complexity, analysis, transformation, number 2566 in Lecture Notes in Computer Science
, 2002
"... www.cs.chalmers.se Abstract. The equational theories at the core of most functional programming are variations on the standard lambda calculus. The bestknown of these is the callbyvalue lambda calculus whose core is the valuebeta computation rule (λx.M)V → M [V/x] where V is restricted to be a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
www.cs.chalmers.se Abstract. The equational theories at the core of most functional programming are variations on the standard lambda calculus. The bestknown of these is the callbyvalue lambda calculus whose core is the valuebeta computation rule (λx.M)V → M [V/x] where V is restricted to be a
Results 1  10
of
7,651