Results 1  10
of
16
Proving congruence of bisimulation in functional programming languages
 Information and Computation
, 1996
"... Email: howe research.att.com We give a method for proving congruence of bisimulationlike equivalences in functional programming languages. The method applies to languages that can be presented as a set of expressions together with an evaluation relation. We use this method to show that some genera ..."
Abstract

Cited by 113 (1 self)
 Add to MetaCart
(Show Context)
Email: howe research.att.com We give a method for proving congruence of bisimulationlike equivalences in functional programming languages. The method applies to languages that can be presented as a set of expressions together with an evaluation relation. We use this method to show that some generalizations of Abramsky's applicative bisimulation are congruences whenever evaluation can be specified by a certain natural form of structured operational semantics. One of the generalizations handles nondeterminism and diverging computations.] 1996 Academic Press, Inc. 1.
The Term Graph Programming System HOPS
 Tool Support for System Specification, Development and Verification, Advances in Computing Science
, 1999
"... this paper have been generated from the latest version of HOPS. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
this paper have been generated from the latest version of HOPS.
A weak calculus with explicit operators for pattern matching and substitution
 In Tison [Tis02
, 2002
"... Abstract. In this paper we propose a Weak Lambda Calculus called λPw having explicit operators for Pattern Matching and Substitution. This formalism is able to specify functions defined by cases via pattern matching constructors as done by most modern functional programming languages such as OCAML. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. In this paper we propose a Weak Lambda Calculus called λPw having explicit operators for Pattern Matching and Substitution. This formalism is able to specify functions defined by cases via pattern matching constructors as done by most modern functional programming languages such as OCAML. We show the main property enjoyed by λPw, namely subject reduction, confluence and strong normalization. 1
A Calculus of Lambda Calculus Contexts
 Journal of Automated Reasoning
, 2001
"... The calculus c serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole lling, by a mechanism of delayed substitution. The context calculus c is given in the form of an extension of th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
The calculus c serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole lling, by a mechanism of delayed substitution. The context calculus c is given in the form of an extension of the lambda calculus. Many notions of context can be represented within the framework; a particular variation can be obtained by the choice of a pretyping, which we illustrate by three examples. 1.
Internally Typed SecondOrder Term Graphs
 Graph Theoretic Concepts in Computer Science, WG '98
, 1998
"... . Wepresent a typingconcept for secondorder term graphsthat doesnot ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
. Wepresent a typingconcept for secondorder term graphsthat doesnot
Standardization and Evaluation in Combinatory Reduction Systems
, 2000
"... A rewrite system has standardization i for any rewrite sequence there is an equivalent one which contracts the redexes in a standard order. Standardization is extremely useful for finding normalizing strategies and proving that a rewrite system for a programming language is sound with respect to the ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
A rewrite system has standardization i for any rewrite sequence there is an equivalent one which contracts the redexes in a standard order. Standardization is extremely useful for finding normalizing strategies and proving that a rewrite system for a programming language is sound with respect to the language's operational semantics. Although for some rewrite systems the standardorder can be simple, e.g., lefttoright or outermostfirst, many systems need a more delicate order. There are abstract notions of standard order which always apply, but proofs (often quite dicult) are required that the rewrite system satis es a number of axioms and not much guidance is provided for finding a concrete order that satisfies the abstract definition. This paper gives a framework based on combinatory reduction systems (CRS's) which is general enough to handle many programming languages. If the CRS is orthogonal and fully extended and a good redex ordering can be found, then a standard order is obtain...
Two Applications of Standardization and Evaluation in Combinatory Reduction Systems
, 2000
"... We present two worked applications of a general framework that can be used to support reasoning about the operational equality relation defined by a programming language semantics. The framework, based on Combinatory Reduction Systems, facilitates the proof of standardization theorems for programmin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We present two worked applications of a general framework that can be used to support reasoning about the operational equality relation defined by a programming language semantics. The framework, based on Combinatory Reduction Systems, facilitates the proof of standardization theorems for programming calculi. The importance of standardization theorems to programming language semantics was shown by Plotkin [Plo75]: standardization together with confluence guarantee that two terms equated in the calculus are semantically equal. We apply the framework to the &lambda;_&nu;calculus and to an untyped version of the &lambda;^CILcalculus. The latter is a basis for an intermediate language being used in a compiler.
Conservation and Uniform Normalization in Lambda Calculi With Erasing Reductions
, 2002
"... For a notion of reduction in a #calculus one can ask whether a term satises conservation and uniform normalization. Conservation means that singlestep reductions of the term preserve innite reduction paths from the term. Uniform normalization means that either the term will have no reduction path ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
For a notion of reduction in a #calculus one can ask whether a term satises conservation and uniform normalization. Conservation means that singlestep reductions of the term preserve innite reduction paths from the term. Uniform normalization means that either the term will have no reduction paths leading to a normal form, or all reduction paths will lead to a normal form.
Extending Partial Combinatory Algebras
, 1999
"... Introduction Consider a structure A = hA; s; k; \Deltai, where A is some set containing the distinguished elements s; k, equipped with a binary operation \Delta on A, called application, which may be partial. Notation 1.1. 1 Instead of a \Delta b we write ab; and in writing applicative expression ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Introduction Consider a structure A = hA; s; k; \Deltai, where A is some set containing the distinguished elements s; k, equipped with a binary operation \Delta on A, called application, which may be partial. Notation 1.1. 1 Instead of a \Delta b we write ab; and in writing applicative expressions, the usual convention of association to the left is employed. So for elements a; b; c 2 A, the expression aba(ac) is short for ((a \Delta b) \Delta a) \Delta (a \Delta c). 2 ab # will mean that ab is defined; ab " means that ab is not defined. Obviously, an applicative expression
On Lazy Commutation
, 2009
"... We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.