Results 1  10
of
2,991,053
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 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
Typing of Selective lambdaCalculus
, 1993
"... Record calculi have recently been a very active field of research, but its reciprocal, i.e. the use of keywords in functions, is still ignored. Selective calculus is a conservative extension of lambda calculus which, by labeling abstractions and applications, enables some form of commutation betwee ..."
Abstract
 Add to MetaCart
Record calculi have recently been a very active field of research, but its reciprocal, i.e. the use of keywords in functions, is still ignored. Selective calculus is a conservative extension of lambda calculus which, by labeling abstractions and applications, enables some form of commutation
The Algebraic LambdaCalculus
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2009
"... We introduce an extension of the pure lambdacalculus by endowing the set of terms with a structure of vector space, or more generally of module, over a fixed set of scalars. Terms are moreover subject to identities similar to usual pointwise definition of linear combinations of functions with value ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
We introduce an extension of the pure lambdacalculus by endowing the set of terms with a structure of vector space, or more generally of module, over a fixed set of scalars. Terms are moreover subject to identities similar to usual pointwise definition of linear combinations of functions
Expressibility in the LambdaCalculus with Letrec
, 2012
"... We investigate the relationship between finite terms in λletrec, the lambda calculus with letrec, and the infinite lambda terms they express. As there are easy examples of infinite λterms that, intuitively, are not unfoldings of terms in λletrec, we consider the question: How can those infinite lam ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We investigate the relationship between finite terms in λletrec, the lambda calculus with letrec, and the infinite lambda terms they express. As there are easy examples of infinite λterms that, intuitively, are not unfoldings of terms in λletrec, we consider the question: How can those infinite
..., Constructive Reals and lambdaCalculus
, 1999
"... Contents 0 Introduction 5 1 HA # and constructive reals 7 1.1 HA # (9.1.1  9.1.14) . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.1.1 #terms in HA # . . . . . . . . . . . . . . . . . . . . . . . . 11 1.1.2 The theories E HA # , I HA # . . . . . . . . . . . . . . . 12 1.1.3 Em ..."
Abstract
 Add to MetaCart
Contents 0 Introduction 5 1 HA # and constructive reals 7 1.1 HA # (9.1.1  9.1.14) . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.1.1 #terms in HA # . . . . . . . . . . . . . . . . . . . . . . . . 11 1.1.2 The theories E HA # , I HA # . . . . . . . . . . . . . . . 12 1.1.3 Embedding of HA in HA # . . . . . . . . . . . . . . . . . . 13 1.2 Constructive real numbers (5.1  5.4, 6.1) . . . . . . . . . . . . . 15 1.2.1 Introduction of Z in HA, HA # (5.1.1) . . . . . . . . . . . 15 1.2.2 Introduction of Q in HA, HA # (5.1.1) . . . . . . . . . . . 15 1.2.3 Principal ideas for embedding R into HA # (5.1.2) . . . . . 16 1.2.4 Theory in which the following can be formalized . . . . . 17 1.2.5 Introduction of<F13.3
A Linearization of the LambdaCalculus and Consequences
, 2000
"... We embed the standard #calculus, denoted #, into two larger #calculi, denoted # # and &# # . The standard notion of #reduction for # corresponds to two new notions of reduction, # # for # # and &# # for &# # . A distinctive feature of our new calculus # # (resp., &# # ) is that, i ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We embed the standard #calculus, denoted #, into two larger #calculi, denoted # # and &# # . The standard notion of #reduction for # corresponds to two new notions of reduction, # # for # # and &# # for &# # . A distinctive feature of our new calculus # # (resp., &# # ) is that
A nominal axiomatisation of the lambdacalculus
"... The lambdacalculus is a fundamental syntax in computer science. It resists an algebraic treatment because of captureavoidance sideconditions. Nominal algebra is a logic of equality designed with formalisation of specifications involving binding in mind. In this paper we axiomatise the lambdacalc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The lambdacalculus is a fundamental syntax in computer science. It resists an algebraic treatment because of captureavoidance sideconditions. Nominal algebra is a logic of equality designed with formalisation of specifications involving binding in mind. In this paper we axiomatise the lambdacalculus
Normal Forms for the Algebraic LambdaCalculus
"... We study the problem of defining normal forms of terms for the algebraic λcalculus, an extension of the pure λcalculus where linear combinations of terms are firstclass entities: the set of terms is enriched with a structure of vector space, or module, over a fixed semiring. Towards a solution to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
coefficients: terms coefficients are replaced by indeterminates and then, after reduction has taken placed, restored back to their original value by an evaluation function. Such a special setting permits us to talk about normal forms of terms and, via an evaluation function, to define such notion for any
EXTENDING THE LAMBDACALCULUS WITH UNBIND AND REBIND
 THEORETICAL INFORMATICS AND APPLICATIONS
, 1999
"... We extend the simply typed λcalculus with unbind and rebind primitive constructs. That is, a value can be a fragment of open code, which in order to be used should be explicitly rebound. This mechanism nicely coexists with standard static binding. The motivation is to provide an unifying foundation ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We extend the simply typed λcalculus with unbind and rebind primitive constructs. That is, a value can be a fragment of open code, which in order to be used should be explicitly rebound. This mechanism nicely coexists with standard static binding. The motivation is to provide an unifying
On the confluence of lambdacalculus with conditional rewriting
, 2011
"... The confluence of untyped λcalculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λcalculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller a ..."
Abstract
 Add to MetaCart
The confluence of untyped λcalculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λcalculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller
Results 1  10
of
2,991,053