Proof-term synthesis on dependent-type systems via explicit substitutions
Theoretical Computer Science
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
From Higher-Order to First-Order Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Program Representation Size in an Intermediate Language with Intersection and Union Types
TIC '00 Selected papers from the Third International Workshop on Types in Compilation
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
Reductions, intersection types, and explicit substitutions
Mathematical Structures 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
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Journal of Functional Programming
Normalisation for higher-order calculi with explicit substitutions
Theoretical Computer Science - Foundations of software science and computation structures
Resource operators for λ-calculus
Information and Computation
Abstract Conditions for the Confluence of Explicit Substitution Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A normalisation result for higher-order calculi with explicit substitutions
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Intersection type systems and explicit substitutions calculi
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A prismoid framework for languages with resources
Theoretical Computer Science
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
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 |