Characterising Explicit Substitutions which Preserve Termination
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A Simply Typed Context Calculus with First-Class Environments
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Characterising Strong Normalisation for Explicit Substitutions
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Programming and Computing in HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Proof Nets and Explicit Substitutions
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Explicit Substitutions and Programming Languages
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Closed Reductions in the lambda-Calculus
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
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
HOL-λσ: an intentional first-order expression of higher-order logic
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
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
The λse-calculus does not preserve strong normalisation
Journal of Functional Programming
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
Pattern matching as cut elimination
Theoretical Computer Science
Closed reduction: explicit substitutions without $\alpha$-conversion
Mathematical Structures in Computer Science
Normalisation for higher-order calculi with explicit substitutions
Theoretical Computer Science - Foundations of software science and computation structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Resource operators for λ-calculus
Information and Computation
Principal Typings for Explicit Substitutions Calculi
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Perpetuality for Full and Safe Composition (in a Constructive Setting)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Journal of Functional Programming
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
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
Simple proofs of characterizing strong normalization for explicit substitution calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A prismoid framework for languages with resources
Theoretical Computer Science
Functorial boxes in string diagrams
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
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
Curry-Style explicit substitutions for the linear and affine lambda calculus
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
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 | 0.00 |