Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9656015 | Electronic Notes in Theoretical Computer Science | 2005 | 17 Pages |
Abstract
Following the works on explicit substitutions in the λ-calculus, we propose, study and exemplify a Ï-calculus with explicit constraint handling, up to the level of substitution applications. The approach is general, allowing the extension to various matching theories. We show that the calculus is powerful enough to deal with errors. We establish the confluence of the calculus and the termination of the explicit constraint handling and application sub-calculus.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Horatiu Cirstea, Germain Faure, Claude Kirchner,