Aaron Stump

From MaRDI portal
Person:286782

Available identifiers

zbMath Open stump.aaronMaRDI QIDQ286782

List of research outcomes





PublicationDate of PublicationType
Simulating large eliminations in Cedille2024-08-01Paper
Impredicative encodings of inductive-inductive data in Cedille2024-02-28Paper
Quotients by Idempotent Functions in Cedille2022-08-30Paper
Monotone recursive types and recursive data representations in Cedille2022-05-17Paper
https://portal.mardi4nfdi.de/entity/Q50206232022-01-06Paper
https://portal.mardi4nfdi.de/entity/Q58547312021-03-17Paper
https://portal.mardi4nfdi.de/entity/Q49646942021-03-03Paper
Efficient Mendler-style lambda-encodings in Cedille2018-10-04Paper
From realizability to induction via dependent intersection2018-06-05Paper
The calculus of dependent lambda eliminations2017-10-23Paper
Efficiency of lambda-encodings in total type theory2017-10-23Paper
A lazy approach to adaptive exact real arithmetic using floating-point operations2017-06-22Paper
Dualized Simple Type Theory2017-04-11Paper
The 2013 evaluation of SMT-COMP and SMT-LIB2016-05-26Paper
A language-based approach to functionally correct imperative programming2015-01-06Paper
Self Types for Dependently Typed Lambda Encodings2014-07-24Paper
SMT proof checking using a logical framework2014-03-28Paper
Imperative LF meta-programming2014-01-10Paper
Mining propositional simplification proofs for small validating clauses2013-09-26Paper
Validated proof-producing decision procedures2013-09-25Paper
Logical semantics for the rewriting calculus2013-09-25Paper
From Rogue to MicroRogue2013-09-20Paper
Producing proofs from an arithmetic decision procedure in elliptical LF2013-08-19Paper
A Rewriting View of Simple Typing2013-04-09Paper
versat: A Verified Modern SAT Solver2012-06-15Paper
Type Preservation as a Confluence Problem2012-04-24Paper
Automated Deduction – CADE-192010-04-20Paper
Directly reflective meta-programming2010-03-05Paper
Knuth-Bendix completion of theories of commuting group endomorphisms2010-01-18Paper
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker2008-09-25Paper
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)2007-11-28Paper
Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)2007-01-30Paper
Computer Aided Verification2006-01-10Paper
Term Rewriting and Applications2005-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48090742004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47371302004-08-11Paper
A trustworthy proof checker2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q48049192003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q48048992003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q27234102001-07-05Paper

Research outcomes over time

This page was built for person: Aaron Stump