A new formula for the execution of categorical combinators
Proc. of the 8th international conference on Automated deduction
Verification of combinational logic in Nuprl
Proceedings of the Mathematical Sciences Institute workshop on Hardware specification, verification and synthesis: mathematical aspects
An analysis of Bo¨hm's theorem
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Theoretical Computer Science
Term rewriting and all that
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
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
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations
A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Hi-index | 0.00 |
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to understand and explain properties of these calculi and to compare the different styles of making explicit the substitution operation in implementations of the @l-calculus in de Bruijn notation. The system was developed in OCaml and now it can be executed inside the Emacs editor within a new mode which allows a very easy interaction. The use of special symbols makes its application very useful for students because the notation on the screen is as close as possible to that on the paper. In addition to dealing the @l-calculus and explicit substitutions calculi in de Bruijn notation, now it is possible to work with the @l-calculus and with several calculi of explicit substitutions using also representation of variables with names. Moreover, in contrast to the original version of the system, that was restricted to three specific calculi of explicit substitution, the new version allows the inclusion of new calculi by giving as input their grammatical descriptions. SUBSEXPL has been used with success for teaching basic properties of the @l-calculus and for illustrating the computational impact of selecting one kind of representation of variables (either names or indices) and a specific style of making explicit substitutions in real implementations based on the @l-calculus.