Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
An equivalence between lambda-terms
Theoretical Computer Science
Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Strong normalization from weak normalization in typed &lgr;-calculi
Information and Computation
Explicit substitution on the edge of strong normalization
Theoretical Computer Science
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Polarized proof-nets and λµ-calculus
Theoretical Computer Science
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Typed lambda-calculi with explicit substitutions may not terminate
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Lambda-Calculus `a la de Bruijn with Explicit Substitutions
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
A Proof of Weak Termination of Typed lambda-sigma-Calculi
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Proof Nets and Explicit Substitutions
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Explicit Substitutions and Programming Languages
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Strong Normalization of Proof Nets Modulo Structural Congruences
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Closed Reductions in the lambda-Calculus
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Weak and Strong Beta Normalisations in Typed Lambda-Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Higher-order Unification via Explicit Substitutions
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Pattern Matching as Cut Elimination
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Intersection types for explicit substitutions
Information and Computation
Reductions, intersection types, and explicit substitutions
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Efficient reductions with director strings
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Natural deduction via graphs: formal definition and computation rules
Mathematical Structures in Computer Science
Nested proof search as reduction in the Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
The theory of calculi with explicit substitutions revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
We present a simple term language with explicit operators for erasure, duplication and substitution enjoying a sound and complete correspondence with the intuitionistic fragment of Linear Logic's Proof Nets. We establish the good operational behaviour of the language by means of some fundamental properties such as confluence, preservation of strong normalisation, strong normalisation of well-typed terms and step by step simulation. This formalism is the first term calculus with explicit substitutions having full composition and preserving strong normalisation.