A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
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
Compilation of extended recursion in call-by-value functional languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
Pure type systems with explicit substitution
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
Explaining the lazy Krivine machine using explicit substitution and addresses
Higher-Order and Symbolic Computation
Perpetuality for Full and Safe Composition (in a Constructive Setting)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Electronic Notes in Theoretical Computer Science (ENTCS)
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
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 |