Proving Theorems about LISP Functions
Journal of the ACM (JACM)
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Scrap your boilerplate: a practical design pattern for generic programming
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Higher-Order and Symbolic Computation
Type-Directed Partial Evaluation
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
A Finite Axiomatization of Inductive-Recursive Definitions
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Intuitionistic model constructions and normalization proofs
Mathematical Structures in Computer Science
Journal of Functional Programming
Termination of rewriting in the Calculus of Constructions
Journal of Functional Programming
Normalization by Evaluation for Martin-Löf Type Theory with One Universe
Electronic Notes in Theoretical Computer Science (ENTCS)
Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Implementing a normalizer using sized heterogeneous types
Journal of Functional Programming
Normalization by evaluation for the computational lambda-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A formalisation of a dependently typed language as an inductive-recursive family
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Dependently typed programming in Agda
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Hereditary substitutions for simple types, formalized
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
Inductive type schemas as functors
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 0.00 |
The definitional equality of an intensional type theory is its test of type compatibility. Today's systems rely on ordinary evaluation semantics to compare expressions in types, frustrating users with type errors arising when evaluation fails to identify two `obviously' equal terms. If only the machine could decide a richer theory! We propose a way to decide theories which supplement evaluation with `ν-rules', rearranging the neutral parts of normal forms, and report a successful initial experiment. We study a simple λ-calculus with primitive fold, map and append operations on lists and develop in Agda a sound and complete decision procedure for an equational theory enriched with monoid, functor and fusion laws.