Compiling the polymorphic &lgr;-calculus
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
CPS translating inductive and coinductive types
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
Theoretical Computer Science - Special issue on theories of types and proofs
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
Encoding Intensional Type Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Calculus of Circular Proofs and Its Categorical Semantics
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Syntax-Directed Amorphous Slicing
Automated Software Engineering
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Coercive Subtyping via Mappings of Reduction Behaviour
Electronic Notes in Theoretical Computer Science (ENTCS)
An induction principle for nested datatypes in intensional type theory
Journal of Functional Programming
A3PAT, an approach for certified automated termination proofs
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Formalising exact arithmetic in type theory
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.01 |