Author of the publication

Signature Compilation for the Edinburgh Logical Framework.

, , and . LFMTP@CADE, volume 196 of Electronic Notes in Theoretical Computer Science, page 129-135. Elsevier, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Faster Proof Checking in the Edinburgh Logical Framework., and . CADE, volume 2392 of Lecture Notes in Computer Science, page 392-407. Springer, (2002)The SMT-LIB Initiative and the Rise of SMT - (HVC 2010 Award Talk)., , , , and . Haifa Verification Conference, volume 6504 of Lecture Notes in Computer Science, page 3. Springer, (2010)A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille.. LFMTP@LICS, volume 307 of EPTCS, page 55-67. (2019)Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)., , and . Formal Methods Syst. Des., 31 (3): 221-239 (2007)Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)., , and . J. Autom. Reason., 35 (4): 373-390 (2005)Generic derivation of induction for impredicative encodings in Cedille., and . CPP, page 215-227. ACM, (2018)Course-of-Value Induction in Cedille., , , and . CoRR, (2018)CVC: A Cooperating Validity Checker., , and . CAV, volume 2404 of Lecture Notes in Computer Science, page 500-504. Springer, (2002)Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT., , and . CAV, volume 2404 of Lecture Notes in Computer Science, page 236-249. Springer, (2002)Proof Checking Technology for Satisfiability Modulo Theories. Electr. Notes Theor. Comput. Sci., (2009)