Yohji Akama
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
FSCD, 2017.
@inproceedings{FSCD-2017-Akama,
author = "Yohji Akama",
booktitle = "{Proceedings of the Second International Conference on Formal Structures for Computation and Deduction}",
doi = "10.4230/LIPIcs.FSCD.2017.6",
isbn = "978-3-95977-047-7",
pages = "19",
publisher = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
title = "{The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type}",
year = 2017,
}











