Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference64 articles.
1. Ariel Arbiser, Eduardo Bonelli, and Alejandro R´\ios. Perpetuality in a lambda calculus with explicit substitutions and composition. Workshop Argentino de Informática Teórica (WAIT), JAIIO, 2000.
2. Explicit substitutions
3. Peter Aczel. A general church-rosser theorem, 1978. Unpublished note, University of Manchester.
4. Beniamino Accattoli and Stefano Guerrini. Jumping Boxes. Representing lambda-calculus boxes by jumps. In18th EACSL Annual Conference on Computer Science Logic (CSL),Lecture Notes in Computer Science, September 2009.
5. Henk Barendregt, Jan Bergstra, Jan-Willem Klop, and Henri Volken. Degress, reductions and representability in the lambda calculus. Technical Report 22, Utrecht University, 1976.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Strong Bisimulation for a Classical Term Calculus;Logical Methods in Computer Science;2024-04-18
2. Node Replication: Theory And Practice;Logical Methods in Computer Science;2024-01-23
3. Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic;Logical Methods in Computer Science;2023-12-14
4. A Formalized Extension of the Substitution Lemma in Coq;Electronic Proceedings in Theoretical Computer Science;2023-09-22
5. A strong call-by-need calculus;Logical Methods in Computer Science;2023-03-24