Theoretical Computer Science - Special issue on theories of types and proofs
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Specification and Verification of a Formal System for Structurally Recursive Functions
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
The Calculus of algebraic Constructions
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
An Introduction to Dependent Type Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Type-based termination of recursive definitions
Mathematical Structures in Computer Science
Termination of rewriting in the Calculus of Constructions
Journal of Functional Programming
Pattern matching as cut elimination
Theoretical Computer Science
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Expressing combinatory reduction systems derivations in the rewriting calculus
Higher-Order and Symbolic Computation
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Harnessing first order termination provers using higher order dependency pairs
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Higher-order termination: from kruskal to computability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Computability closure: ten years later
Rewriting Computation and Proof
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |