Results 1  10
of
386
Understanding untyped ... calculus
, 2004
"... We prove the confluence of λµ�µT and λµ�µQ, two wellbehaved subcalculi of the λµ�µ calculus, closed under callbyname and callbyvalue reduction, respectively. ..."
Abstract
 Add to MetaCart
We prove the confluence of λµ�µT and λµ�µQ, two wellbehaved subcalculi of the λµ�µ calculus, closed under callbyname and callbyvalue reduction, respectively.
TypeFree CurryHoward Isomorphisms (A ProofTheory Inspired Exposition of the Isomorphism between the Untyped Calculus with Variable Names and à la de Bruijn)
"... We give an alternative, prooftheory inspired proof of the wellknown result that the untyped calculus presented with variable names and `a la de Bruijn are isomorphic. The two presentations of the calculus come about from two isomorphic logic formalisations by observing that, for the logic in ..."
Abstract
 Add to MetaCart
We give an alternative, prooftheory inspired proof of the wellknown result that the untyped calculus presented with variable names and `a la de Bruijn are isomorphic. The two presentations of the calculus come about from two isomorphic logic formalisations by observing that, for the logic
On understanding types, data abstraction, and polymorphism
 ACM COMPUTING SURVEYS
, 1985
"... Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Objectoriented languag ..."
Abstract

Cited by 845 (13 self)
 Add to MetaCart
oriented languages provide both a framework and a motivation for exploring the interaction among the concepts of type, data abstraction, and polymorphism, since they extend the notion of type to data abstraction and since type inheritance is an important form of polymorphism. We develop a λcalculusbased model
A theory of primitive objects: Untyped and firstorder systems
 In Proc. TACS’94, Theoretical Aspects of Computing Sofware
, 1994
"... We introduce simple object calculi that support method override and object subsumption. We give an untyped calculus, typing rules, and equational rules. We illustrate the expressiveness of our calculi and the pitfalls that we avoid. 1. ..."
Abstract

Cited by 82 (11 self)
 Add to MetaCart
We introduce simple object calculi that support method override and object subsumption. We give an untyped calculus, typing rules, and equational rules. We illustrate the expressiveness of our calculi and the pitfalls that we avoid. 1.
Untyped Constrained Lambda Calculus
 LUDWIGMAXIMILIANSUNIVERSIT T, LEOPOLDSTRAE 11B, 80802 MNCHEN
, 1993
"... A calculus which extends the untyped λcalculus by constraints is presented. The constraints can be used for two purposes: in a passive way for restricting the range of variables and in an active way for computing solutions of goals. Rules for the constrained λcalculus are pre ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A calculus which extends the untyped λcalculus by constraints is presented. The constraints can be used for two purposes: in a passive way for restricting the range of variables and in an active way for computing solutions of goals. Rules for the constrained λcalculus
Godelisation in the Untyped Lambda Calculus
, 1999
"... It is wellknown that one cannot inside the pure untyped lambda calculus determine equivalence. I.e., one cannot determine if two terms are betaequivalent, even if they both have normal forms. This implies that it is impossible in the pure untyped lambda calculus to do Godelisation, i.e. to write a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
It is wellknown that one cannot inside the pure untyped lambda calculus determine equivalence. I.e., one cannot determine if two terms are betaequivalent, even if they both have normal forms. This implies that it is impossible in the pure untyped lambda calculus to do Godelisation, i.e. to write
Untyped LambdaCalculus with InputOutput (Progress Report)
 LA JOLLA
, 1995
"... We introduce an untypedcalculus with inputoutput, based on Gordon's continuationpassing model of inputoutput. This calculus is intended to allow the classification of possibly infinite inputoutput behaviors. We introduce a property, called "losslessness," which is a natural prope ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We introduce an untypedcalculus with inputoutput, based on Gordon's continuationpassing model of inputoutput. This calculus is intended to allow the classification of possibly infinite inputoutput behaviors. We introduce a property, called "losslessness," which is a natural
On untyped CurienHerbelin calculus
"... Abstract. We prove the confluence of λµeµT and λµeµQ, two wellbehaved subcalculi of Curien and Herbelin’s λµeµ calculus, stable under callbyname and callbyvalue reduction, respectively. Moreover, we study the semantics of λµeµ calculus, give the interpretation of λµeµT and λµeµQ using ..."
Abstract
 Add to MetaCart
Abstract. We prove the confluence of λµeµT and λµeµQ, two wellbehaved subcalculi of Curien and Herbelin’s λµeµ calculus, stable under callbyname and callbyvalue reduction, respectively. Moreover, we study the semantics of λµeµ calculus, give the interpretation of λµeµT and λµeµQ using
Embeddings and Infinite reduction paths in Untyped λcalculus
"... The term\Omega j ! ! with ! j x:x x is the simplest term in untyped calculus with an infinite reduction path:\Omega !\Omega ! : : : In every step of the reduction path the term reduces to itself. This characterization does not apply to all infinite reduction paths. In this paper we develop two ch ..."
Abstract
 Add to MetaCart
The term\Omega j ! ! with ! j x:x x is the simplest term in untyped calculus with an infinite reduction path:\Omega !\Omega ! : : : In every step of the reduction path the term reduces to itself. This characterization does not apply to all infinite reduction paths. In this paper we develop two
Results 1  10
of
386