default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAaron Stump
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Anthony Cantor, Aaron Stump:
Dual counterpart intuitionistic logic. J. Log. Comput. 34(3): 590-634 (2024)- 2023
- [j20]Pedro Abreu
, Benjamin Delaware, Alex Hubers, Christa Jenkins, J. Garrett Morris, Aaron Stump:
A Type-Based Approach to Divide-and-Conquer Recursion in Coq. Proc. ACM Program. Lang. 7(POPL): 61-90 (2023) - [c56]Andrew Marmaduke, Larry Diehl, Aaron Stump:
Impredicative Encodings of Inductive-Inductive Data in Cedille. TFP 2023: 1-15 - 2021
- [j19]Christopher Jenkins, Aaron Stump:
Monotone recursive types and recursive data representations in Cedille. Math. Struct. Comput. Sci. 31(6): 682-745 (2021) - [c55]Christa Jenkins, Andrew Marmaduke, Aaron Stump:
Simulating Large Eliminations in Cedille. TYPES 2021: 9:1-9:22 - [i11]Aaron Stump, Benjamin Delaware, Christopher Jenkins:
Relational Type Theory (All Proofs). CoRR abs/2101.09655 (2021) - [i10]Christopher Jenkins, Andrew Marmaduke, Aaron Stump:
Simulating Large Eliminations in Cedille. CoRR abs/2112.07817 (2021) - 2020
- [j18]Aaron Stump, Christopher Jenkins, Stephan Spahn, Colin McDonald:
Strong functional pearl: Harper's regular-expression matcher in Cedille. Proc. ACM Program. Lang. 4(ICFP): 122:1-122:25 (2020) - [c54]Andrew Marmaduke, Christopher Jenkins, Aaron Stump:
Zero-Cost Constructor Subtyping. IFL 2020: 93-103 - [c53]Christopher Jenkins, Aaron Stump, Larry Diehl:
Efficient lambda encodings for Mendler-style coinductive types in Cedille. MSFP@ETAPS 2020: 72-97 - [i9]Christopher Jenkins, Aaron Stump:
Monotone recursive types and recursive data representations in Cedille. CoRR abs/2001.02828 (2020)
2010 – 2019
- 2019
- [c52]Andrew Marmaduke, Christopher Jenkins, Aaron Stump:
Quotients by Idempotent Functions in Cedille. TFP 2019: 1-20 - [c51]Aaron Stump:
A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille. LFMTP@LICS 2019: 55-67 - [i8]Christopher Jenkins, Colin McDonald, Aaron Stump:
Elaborating Inductive Datatypes and Course-of-Values Pattern Matching to Cedille. CoRR abs/1903.08233 (2019) - 2018
- [j17]Aaron Stump:
From realizability to induction via dependent intersection. Ann. Pure Appl. Log. 169(7): 637-655 (2018) - [j16]Larry Diehl, Denis Firsov, Aaron Stump:
Generic zero-cost reuse for dependent types. Proc. ACM Program. Lang. 2(ICFP): 104:1-104:30 (2018) - [c50]Denis Firsov, Aaron Stump:
Generic derivation of induction for impredicative encodings in Cedille. CPP 2018: 215-227 - [c49]Christopher Jenkins, Aaron Stump:
Spine-local Type Inference. IFL 2018: 37-48 - [c48]Denis Firsov, Richard Blair, Aaron Stump:
Efficient Mendler-Style Lambda-Encodings in Cedille. ITP 2018: 235-252 - [i7]Larry Diehl, Aaron Stump:
Zero-Cost Coercions for Program and Proof Reuse. CoRR abs/1802.00787 (2018) - [i6]Denis Firsov, Richard Blair, Aaron Stump:
Efficient Mendler-Style Lambda-Encodings in Cedille. CoRR abs/1803.02473 (2018) - [i5]Larry Diehl, Denis Firsov, Aaron Stump:
Generic Zero-Cost Reuse for Dependent Types. CoRR abs/1803.08150 (2018) - [i4]Christopher Jenkins, Aaron Stump:
Spine-local Type Inference. CoRR abs/1805.10383 (2018) - [i3]Aaron Stump:
Syntax and Semantics of Cedille. CoRR abs/1806.04709 (2018) - [i2]Aaron Stump:
Syntax and Typing for Cedille Core. CoRR abs/1811.01318 (2018) - [i1]Denis Firsov, Larry Diehl, Christopher Jenkins, Aaron Stump:
Course-of-Value Induction in Cedille. CoRR abs/1811.11961 (2018) - 2017
- [j15]Aaron Stump:
The calculus of dependent lambda eliminations. J. Funct. Program. 27: e14 (2017) - 2016
- [b2]Aaron Stump:
Verified Functional Programming in Agda. ACM Books 9, ACM 2016, ISBN 978-1-970001-27-3 - [j14]Harley Eades III, Aaron Stump, Ryan McCleeary:
Dualized Simple Type Theory. Log. Methods Comput. Sci. 12(3) (2016) - [j13]Aaron Stump, Peng Fu:
Efficiency of lambda-encodings in total type theory. J. Funct. Program. 26: e3 (2016) - [c47]Ananda Guneratne, Chad Reynolds, Aaron Stump:
Project Report: Dependently Typed Programming with Lambda Encodings in Cedille. TFP 2016: 115-134 - 2015
- [j12]Ryan McCleeary, Martin Brain, Aaron Stump:
A lazy approach to adaptive exact real arithmetic using floating-point operations. ACM Commun. Comput. Algebra 49(3): 83-86 (2015) - [j11]David R. Cok, Aaron Stump, Tjark Weber:
The 2013 Evaluation of SMT-COMP and SMT-LIB. J. Autom. Reason. 55(1): 61-90 (2015) - 2014
- [c46]Aaron Stump, Geoff Sutcliffe, Cesare Tinelli:
StarExec: A Cross-Community Infrastructure for Logic Solving. IJCAR 2014: 367-373 - [c45]Aaron Stump:
The recursive polarized dual calculus. PLPV 2014: 3-14 - [c44]Peng Fu, Aaron Stump:
Self Types for Dependently Typed Lambda Encodings. RTA-TLCA 2014: 224-239 - 2013
- [j10]Aaron Stump, Duckki Oe, Andrew Reynolds, Liana Hadarean, Cesare Tinelli:
SMT proof checking using a logical framework. Formal Methods Syst. Des. 42(1): 91-118 (2013) - [j9]Clark W. Barrett, Morgan Deters, Leonardo Mendonça de Moura, Albert Oliveras, Aaron Stump:
6 Years of SMT-COMP. J. Autom. Reason. 50(3): 243-277 (2013) - [c43]Harley Eades III, Aaron Stump:
Hereditary Substitution for the λΔ-Calculus. COS 2013: 45-65 - 2012
- [j8]Aaron Stump, Hans Zantema, Garrin Kimmell, Roba El Haj Omar:
A Rewriting View of Simple Typing. Log. Methods Comput. Sci. 9(1) (2012) - [c42]Aaron Stump, Geoff Sutcliffe, Cesare Tinelli:
Introducing StarExec: a Cross-Community Infrastructure for Logic Solving. COMPARE 2012: 2 - [c41]Jean-Christophe Filliâtre, Andrei Paskevich, Aaron Stump:
The 2nd Verified Software Competition: Experience Report. COMPARE 2012: 36-49 - [c40]Jacques Carette, Aaron Stump:
Towards typing for small-step direct reflection. PEPM 2012: 93-96 - [c39]Garrin Kimmell, Aaron Stump, Harley D. Eades III, Peng Fu, Tim Sheard, Stephanie Weirich, Chris Casinghino, Vilhelm Sjöberg, Nathan Collins, Ki Yung Ahn:
Equational reasoning about programs with general recursion and call-by-value semantics. PLPV 2012: 15-26 - [c38]Aaron Stump, Andrew Reynolds, Cesare Tinelli, Austin Laugesen, Harley Eades III, Corey Oliver, Ruoyu Zhang:
LFSC for SMT Proofs: Work in Progress. PxTP 2012: 21-27 - [c37]Adam M. Procter, William L. Harrison, Aaron Stump:
The Design of a Practical Proof Checker for a Lazy Functional Language. Trends in Functional Programming 2012: 117-132 - [c36]Duckki Oe, Aaron Stump, Corey Oliver, Kevin Clancy:
versat: A Verified Modern SAT Solver. VMCAI 2012: 363-378 - [c35]Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn, Nathan Collins, Harley D. Eades III, Peng Fu, Garrin Kimmell, Tim Sheard, Aaron Stump, Stephanie Weirich:
Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems. MSFP 2012: 112-162 - [e4]Aaron Stump, Geoff Sutcliffe, Cesare Tinelli:
Workshop on Evaluation Methods for Solvers, and Quality Metrics for Solutions, EMSQMS 2010, Edinburgh, UK, July 20, 2010. EPiC Series in Computing 6, EasyChair 2012 [contents] - 2011
- [c34]Aaron Stump, Garrin Kimmell, Roba El Haj Omar:
Type Preservation as a Confluence Problem. RTA 2011: 345-360 - [e3]Pascal Fontaine, Aaron Stump:
PxTP 2011: First International Workshop on Proof eXchange for Theorem Proving, Wrocław, Poland, August 1, 2011. 2011 [contents] - 2010
- [c33]Robert Brummayer, Duckki Oe, Aaron Stump:
Exploring Predictability of SAT/SMT Solvers. EMSQMS@IJCAR 2010: 5-18 - [c32]Clark W. Barrett, Leonardo Mendonça de Moura, Silvio Ranise, Aaron Stump, Cesare Tinelli:
The SMT-LIB Initiative and the Rise of SMT - (HVC 2010 Award Talk). Haifa Verification Conference 2010: 3 - [c31]Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich:
Termination Casts: A Flexible Approach to Termination with General Recursion. PAR@ITP 2010: 84-100 - [c30]Aaron Stump, Evan Austin:
Resource typing in Guru. PLPV 2010: 27-38 - [c29]Tim Sheard, Aaron Stump, Stephanie Weirich:
Language-based verification will change the world. FoSER 2010: 343-348 - [c28]Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich:
Termination Casts: A Flexible Approach to Termination with General Recursion. PAR 2010: 76-93 - [c27]Vilhelm Sjöberg, Aaron Stump:
Equality, Quasi-Implicit Products, and Large Eliminations. ITRS 2010: 90-100
2000 – 2009
- 2009
- [j7]Aaron Stump:
Directly reflective meta-programming. High. Order Symb. Comput. 22(2): 115-144 (2009) - [j6]Aaron Stump, Evan Austin:
Resource typing in guru: (abstract only). ACM SIGPLAN Notices 44(11): 7 (2009) - [c26]Edwin M. Westbrook, Aaron Stump, Evan Austin:
The calculus of nominal inductive constructions: an intensional approach to encoding name-bindings. LFMTP 2009: 74-83 - [c25]Aaron Stump, Morgan Deters, Adam Petcher, Todd Schiller, Timothy W. Simpson:
Verified programming in Guru. PLPV 2009: 49-58 - 2008
- [j5]Clark W. Barrett, Morgan Deters, Albert Oliveras, Aaron Stump:
Design and Results of the 3rd Annual Satisfiability Modulo Theories Competition (SMT-Comp 2007). Int. J. Artif. Intell. Tools 17(4): 569-606 (2008) - [c24]Aaron Stump:
Proof Checking Technology for Satisfiability Modulo Theories. LFMTP@LICS 2008: 121-133 - 2007
- [j4]Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump:
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006). Formal Methods Syst. Des. 31(3): 221-239 (2007) - [c23]Aaron Stump:
Lightweight Verification with Dependent Types. VERIFY 2007 - [c22]Michael Zeller, Aaron Stump, Morgan Deters:
Signature Compilation for the Edinburgh Logical Framework. LFMTP@CADE 2007: 129-135 - [e2]Aaron Stump, Hongwei Xi:
Proceedings of the Programming Languages meets Program Verification, PLPV@IJCAR 2006, Part of FLoC 2006, Seattle, WA, USA, August 21, 2006. Electronic Notes in Theoretical Computer Science 174(7), Elsevier 2007 [contents] - [e1]Aaron Stump, Hongwei Xi:
Proceedings of the ACM Workshop Programming Languages meets Program Verification, PLPV 2007, Freiburg, Germany, October 5, 2007. ACM 2007, ISBN 978-1-59593-677-6 [contents] - 2006
- [j3]Aaron Stump, Bernd Löchner:
Knuth-Bendix completion of theories of commuting group endomorphisms. Inf. Process. Lett. 98(5): 195-198 (2006) - [c21]Gary T. Leavens, Jean-Raymond Abrial, Don S. Batory, Michael J. Butler, Alessandro Coglio, Kathi Fisler, Eric C. R. Hehner, Cliff B. Jones, Dale Miller, Simon L. Peyton Jones, Murali Sitaraman, Douglas R. Smith, Aaron Stump:
Roadmap for enhanced languages and methods to aid verification. GPCE 2006: 221-236 - [c20]Ian Wehrman, Aaron Stump, Edwin M. Westbrook:
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker. RTA 2006: 287-296 - [c19]Aaron Stump, Hongwei Xi:
Preface. PLPV@IJCAR 2006: 1-2 - 2005
- [j2]Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump:
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005). J. Autom. Reason. 35(4): 373-390 (2005) - [c18]Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump:
SMT-COMP: Satisfiability Modulo Theories Competition. CAV 2005: 20-23 - [c17]Edwin M. Westbrook, Aaron Stump, Ian Wehrman:
A language-based approach to functionally correct imperative programming. ICFP 2005: 268-279 - [c16]Aaron Stump, Li-Yang Tan:
The Algebra of Equality Proofs. RTA 2005: 469-483 - [c15]Aaron Stump:
Programming with Proofs: Language-Based Approaches to Totally Correct Software. VSTTE 2005: 502-509 - [c14]Ian Wehrman, Aaron Stump:
Mining Propositional Simplification Proofs for Small Validating Clauses. PDPAR@CAV 2005: 79-91 - 2004
- [c13]Robert Klapper, Aaron Stump:
Validated Proof-Producing Decision Procedures. D/PDPAR@IJCAR 2004: 53-68 - [c12]Aaron Stump, Ryan Besand, James C. Brodman, Jonathan Hseu, Bill Kinnersley:
From Rogue to MicroRogue. WRLA 2004: 69-87 - [c11]Aaron Stump:
Imperative LF Meta-Programming. LFM@IJCAR 2004: 149-159 - [c10]Aaron Stump, Carsten Schürmann:
Logical Semantics for the Rewriting Calculus. STRATEGIES@IJCAR 2004: 149-164 - 2003
- [j1]Andrew W. Appel, Neophytos G. Michael, Aaron Stump, Roberto Virga:
A Trustworthy Proof Checker. J. Autom. Reason. 31(3-4): 231-260 (2003) - [c9]Aaron Stump:
Subset Types and Partial Functions. CADE 2003: 151-165 - [c8]Dinghao Wu, Andrew W. Appel, Aaron Stump:
Foundational proof checkers with small witnesses. PPDP 2003: 264-274 - 2002
- [b1]Aaron Stump:
Checking validities and proofs with CVC and flea. Stanford University, USA, 2002 - [c7]Aaron Stump, David L. Dill:
Faster Proof Checking in the Edinburgh Logical Framework. CADE 2002: 392-407 - [c6]Clark W. Barrett, David L. Dill, Aaron Stump:
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. CAV 2002: 236-249 - [c5]Aaron Stump, Clark W. Barrett, David L. Dill:
CVC: A Cooperating Validity Checker. CAV 2002: 500-504 - [c4]Clark W. Barrett, David L. Dill, Aaron Stump:
A Generalization of Shostak's Method for Combining Decision Procedures. FroCoS 2002: 132-146 - [c3]Aaron Stump, Clark W. Barrett, David L. Dill:
Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF. LFM 2002: 29-41 - 2001
- [c2]Aaron Stump, Clark W. Barrett, David L. Dill, Jeremy R. Levitt:
A Decision Procedure for an Extensional Theory of Arrays. LICS 2001: 29-37 - 2000
- [c1]Clark W. Barrett, David L. Dill, Aaron Stump:
A Framework for Cooperating Decision Procedures. CADE 2000: 79-98
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-10 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
