Characterising Explicit Substitutions which Preserve Termination
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
Pure type systems with explicit substitution
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
Intersection types for explicit substitutions
Information and Computation
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Resource operators for λ-calculus
Information and Computation
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Computation with classical sequents
Mathematical Structures in Computer Science
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Reductions, intersection types, and explicit substitutions
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Strong normalisation for a gentzen-like cut-elimination procedure
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Simple proofs of characterizing strong normalization for explicit substitution calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Strong normalisation of cut-elimination that simulates β-reduction
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On a local-step cut-elimination procedure for the intuitionistic sequent calculus
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A sequent calculus for type theory
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On Explicit Substitution with Names
Journal of Automated Reasoning
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
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 | 5.23 |