Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Implementations of Completion by Transition Rules + Control: ORME
Proceedings of the Second International Conference on Algebraic and Logic Programming
Eta-conversion for the Languages of Explicit Substitutions
Proceedings of the Third International Conference on Algebraic and Logic Programming
Termination of Rewrite Systems by Elementary Interpretations
Proceedings of the Third International Conference on Algebraic and Logic Programming
Termination of Term Rewriting by Interpretation
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A framework for implementing hypothetical queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Proof-term synthesis on dependent-type systems via explicit substitutions
Theoretical Computer Science
Interacting with parametrized geometric objects using lambda-terms
Proceedings of the seventh ACM symposium on Solid modeling and applications
Parametrizing geometric objects using λ-calculus
SCCG '02 Proceedings of the 18th spring conference on Computer graphics
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Explicit Substitutions and Programming Languages
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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 Framework for Defining Object-Calculi
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Functional runtime systems within the lambda-sigma calculus
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
A ρ-calculus of explicit constraint application
Higher-Order and Symbolic Computation
Information and Computation
Hierarchical Nominal Terms and Their Theory of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
A concrete framework for environment machines
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Computation with classical sequents
Mathematical Structures in Computer Science
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Theoretical Computer Science
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
New Developments in Environment Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
Science of Computer Programming
The lambda-context calculus (extended version)
Information and Computation
A ρ-Calculus of Explicit Constraint Application
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Conditions for the Confluence of Explicit Substitution Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Reductions, intersection types, and explicit substitutions
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
The language X: circuits, computations and classical logic
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Capture-avoiding substitution as a nominal algebra
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
On Explicit Substitution with Names
Journal of Automated Reasoning
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
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 |
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 &lgr;v, entails a very simple environment machine for strong normalization of &lgr;-terms.