Frédéric Blanqui
CoLoR, a Coq Library on Rewriting and Termination
http://color.inria.fr
Thierry Coquand
1992
Pattern Matching with Dependent Types
http://www.cs.chalmers.se/~coquand/pattern.ps
Proceedings of the Workshop on Logical Frameworks
Harley D Eades III
2014
The semantic analysis of advanced programming languages
The University of Iowa
http://metatheorem.org/wp-content/papers/thesis.pdf
Conor McBride Healfdene Goguen
James McKinna
2006
Eliminating Dependent Pattern Matching
http://cs.ru.nl/~james/RESEARCH/goguen2006.pdf
Harley D. Eades III
Aaron Stump
2010
Hereditary Substitution for Stratified System F
International Workshop on Proof-Search in Type Theories
A FLoC workshop
Edinburgh, Scotland
http://homepage.divms.uiowa.edu/~astump/papers/pstt-2010.pdf
Daniel Leivant
1990
Finitely stratified polymorphism
Technical Report
Carnegie Mellon University
http://repository.cmu.edu/cgi/viewcontent.cgi?article=2961&context=compsci
Gregory Malecha
Adam Chlipala
Thomas Braibant
2014
Compositional Computational Reflection
Gerwin Klein
Ruben Gamboa
ITP'14
Lecture Notes in Computer Science
8558
Springer
374–389
10.1007/978-3-319-08970-6_24
Conor McBride
2005
Epigram: Practical Programming with Dependent Types
Advanced Functional Programming
130–170
10.1007/11546382_3
Ulf Norell
2007
Towards a practical programming language based on dependent type theory
Department of Computer Science and Engineering, Chalmers University of Technology
SE-412 96 Göteborg, Sweden
http://www.cs.chalmers.se/~ulfn/papers/thesis.html
Matthieu Sozeau
2010
Equations: A Dependent Pattern-Matching Compiler
First International Conference on Interactive Theorem Proving
Springer
10.1007/978-3-642-14052-5_29
Jérôme Vouillon
POPLmark challenge solution
http://www.seas.upenn.edu/~plclub/poplmark/vouillon.html