Searching for authors named Pierre Lescanne – sorted by Relevance.
19 documents found, showing 1 through 10.
Next 10 →
-
From λσ to λν - a Journey through Calculi of Explicit Substitutions
- …This paper gives a systematic description of several calculi of explicit substitutions. These systems are orthogonal and have easy proofs of termination of their substitution calculus. The last system, called λσ, entails a very simple environment machine for strong normalization of &lam…
- Add To MetaCart
-
On Termination of One Rule Rewrite Systems
- …this paper we reduce the problem of termination of one rule rewrite systems to problems somewhat more related to rewrite systems namely to Post correspondence problems and to termination of semi-Thue systems. Proofs we obtain this way are shorter and we expect other interesting applications from the…
- Cited by 3 (0 self) – Add To MetaCart
-
Direct Proofs of Strong Normalisation in Calculi of Explicit Substitutions
- …. This paper is part of a general programme of treating explicit substitutions as the primary -calculi from the point of view of foundations as well as applications. Here we investigate the property of strong normalization. To date all the proofs of strong normalization of typed calculi of explicit …
- Add To MetaCart
-
The Calculus of Explicit Substitutions
- …AE-calculus is a new simple calculus of explicit substitutions. In this paper we explore its properties, namely we prove that it correctly implements fi reduction, it is confluent, its simply typed version is strongly normalizing. We associate with AE an abstract machine called the U-machine and we …
- Cited by 5 (1 self) – Add To MetaCart
-
Super-Closures
- …. We propose abstract machines for lazy functional programming languages, based on the Krivine machine, and initially designed for eliding the creation of useless closures. We introduce the notion of super-closure, a data structure representing a list of closures in a compact way. We give four ma…
- Cited by 1 (0 self) – Add To MetaCart
-
Equational Problems and Disunification
- …Roughly speaking, an equational problem is a first order formula whose only predicate symbol is =. We propose some rules for the transformation of equational problems and study their correctness in various models. Then, we give completeness results with respect to some “simple ” problems called solv…
- Cited by 90 (8 self) – Add To MetaCart
-
The Calculus of Explicit Substitutions
- …AE-calculus is a new simple calculus of explicit substitutions. In this paper we explore its properties, namely we prove that it correctly implements fi reduction, it is confluent, its simply typed version is strongly normalizing. We associate with AE an abstract machine called the U-machine and we …
- Add To MetaCart
-
A Framework for Defining Object-Calculi
- …Frederic Lang, Pierre Lescanne, and Luigi Liquori Ecole Normale Superieure de Lyon Laboratoire de l'Informatique du Parallelisme 46, Allee d'Italie, F--69364 Lyon Cedex 07, FRANCE E-mail: fflang,plescann,lliquorig@ens-lyon.fr Abstract. In this paper, we give a general framework for the foundat…
- Cited by 2 (0 self) – Add To MetaCart
-
Rewriting game theory as a foundation for state-based models of gene regulation
- …Abstract. We present a game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory. Rewriting game theory is discrete and comes with a graph-based framework for understanding compromises and interactions between players and for computing Nash equilib…
- Cited by 1 (1 self) – Add To MetaCart
-
Computation with classical sequents
- …X is an untyped continuation-style formal language with a typed subset which provides a Curry-Howard isomorphism for a sequent calculus for implicative classical logic. X can also be viewed as a language for describing nets by composition of basic components connected by wires. These features make X…
- Cited by 6 (6 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
