Proof-term synthesis on dependent-type systems via explicit substitutions
Theoretical Computer Science
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
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
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
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 |