Author of the publication

Termination Casts: A Flexible Approach to Termination with General Recursion.

, , and . PAR@ITP, volume 5 of EPiC Series, page 84-100. EasyChair, (2010)

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

Proof Checking Technology for Satisfiability Modulo Theories. Electr. Notes Theor. Comput. Sci., (2009)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)A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille.. LFMTP@LICS, volume 307 of EPTCS, page 55-67. (2019)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)Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)., , and . Formal Methods Syst. Des., 31 (3): 221-239 (2007)Relational Type Theory (All Proofs)., , and . CoRR, (2021)Dualized Simple Type Theory., , and . Log. Methods Comput. Sci., (2016)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)