Two Techniques for Compiling Lazy Pattern Matching (1994)

by Luc Maranget , Luc Maranget , Projet Para
Citations:10 - 1 self

Documents Related by Co-Citation

81 Compiling pattern matching – L Augustsson - 1985
540 The Implementation of Functional Programming Languages – Peyton Jones, S L - 1987
38 Efficient compilation of pattern matching – P Wadler
21 Synthesizing proofs from programs in the Calculus of Inductive Constructions – Catherine Parent - 1995
11 Implementation of lazy pattern matching algorithms – Alain Laville - 1988
93 The ZINC experiment, an economical implementation of the ML language – Xavier Leroy - 1990
23 Compiling Pattern Matching by Term Decomposition – Laurence Puel, Ascander Suarez - 1989
3 by ftp at site ftp.inria.fr – B Nordstrom, K Petersson, G Plotkin, editors - 1992
12 Développement de l’algorithme d’unification dans le calcul des constructions – J Rouyer - 1992
12 Developing certified programs in the system Coq -- The Program tactic – C. Parent - 1993
55 Real Theorem Provers Deserve Real User-Interfaces – Laurent Thery , Yves Bertot, Gilles Kahn - 1992
46 Extraction de programmes dans le Calcul des Constructions – Christine Paulin-Mohring - 1989
163 Inductive Definitions in the System Coq Rules and Properties – Christine Paulin-Mohring - 1992
53 Synthesis of ML programs in the system Coq – C Paulin-Mohring, B Werner - 1993
30 Terminating General Recursion – Bengt Nordström - 1988
342 Intuitionistic Type Theory – Per Martin-Löf - 1984
65 Compiling a Functional Language – Luca Cardelli - 1984
11 Compiling Lazy Pattern Matching – Luc Maranget - 1992
254 Pict: A programming language based on the pi-calculus – Benjamin C. Pierce, David N. Turner - 1997