Search Results - "Stump, Aaron"

A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille by Stump, Aaron

“…Cedille is a relatively recent tool based on a Curry-style pure type theory, without a primitive datatype system. Using novel techniques based on dependent…”
Get full text

Dualized Simple Type Theory by Eades III, Harley, Stump, Aaron, McCleeary, Ryan

“…We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and…”
Get full text

Rapid prototyping of patterned functional nanostructures by Brinker, C. Jeffrey, Fan, Hongyou, Lu, Yunfeng, Stump, Aaron, Reed, Scott T, Baer, Tom, Schunk, Randy, Perez-Luna, Victor, López, Gabriel P

“…Living systems exhibit form and function on multiple length scales and at multiple locations. In order to mimic such natural structures, it is necessary to…”
Get full text

Hereditary Substitution for the λΔ-Calculus by Eades, Harley, Stump, Aaron

“…Hereditary substitution is a form of type-bounded iterated substitution, first made explicit by Watkins et al. and Adams in order to show normalization of…”
Get full text

Aerosol-assisted self-assembly of mesostructured spherical nanoparticles by YUNFENGLU, HONGYOU FAN, STUMP, A, WARD, T. L, RIEKER, T, BRINKER, C. J

Get full text

Dual counterpart intuitionistic logic by Cantor, Anthony, Stump, Aaron

“…Abstract We introduce dual counterpart intuitionistic logic (or DCInt): a constructive logic that is a conservative extension of intuitionistic logic, a…”
Get full text

A Rewriting View of Simple Typing by Stump, Aaron, Kimmell, Garrin, Zantema, Hans, Omar, Ruba El Haj

“…This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the…”
Get full text

Equality, Quasi-Implicit Products, and Large Eliminations by Sjöberg, Vilhelm, Stump, Aaron

“…This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other…”
Get full text

Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems by Sjöberg, Vilhelm, Casinghino, Chris, Ahn, Ki Yung, Collins, Nathan, Eades III, Harley D., Fu, Peng, Kimmell, Garrin, Sheard, Tim, Stump, Aaron, Weirich, Stephanie

“…We present a full-spectrum dependently typed core language which includes both nontermination and computational irrelevance (a.k.a. erasure), a combination…”
Get full text

Termination Casts: A Flexible Approach to Termination with General Recursion by Stump, Aaron, Sjöberg, Vilhelm, Weirich, Stephanie

“…This paper proposes a type-and-effect system called Teqt, which distinguishes terminating terms and total functions from possibly diverging terms and partial…”
Get full text

Efficient lambda encodings for Mendler-style coinductive types in Cedille by Jenkins, Christopher, Stump, Aaron, Diehl, Larry

Get full text

SMT proof checking using a logical framework by Stump, Aaron, Oe, Duckki, Reynolds, Andrew, Hadarean, Liana, Tinelli, Cesare

“…Producing and checking proofs from SMT solvers is currently the most feasible method for achieving high confidence in the correctness of solver results. The…”
Get full text

The 2013 Evaluation of SMT-COMP and SMT-LIB by Cok, David R., Stump, Aaron, Weber, Tjark

“…After 8 years of SMT Competitions, the SMT Steering Committee decided, for 2013, to sponsor an evaluation of the status of SMT benchmarks and solvers, rather…”
Get full text

6 Years of SMT-COMP by Barrett, Clark, Deters, Morgan, de Moura, Leonardo, Oliveras, Albert, Stump, Aaron

“…The annual Satisfiability Modulo Theories Competition (SMT-COMP) was initiated in 2005 in order to stimulate the advance of state-of-the-art techniques and…”
Get full text

Mining Propositional Simplification Proofs for Small Validating Clauses by Wehrman, Ian, Stump, Aaron

“…The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small…”
Get full text

Aerosol-assisted self-assembly of mesostructured spherical nanoparticles by Brinker, C. Jeffrey, Lu, Yunfeng, Fan, Hongyou, Stump, Aaron, Ward, Timothy L, Rieker, Thomas

“…Particles possessing nanometre-scale pores of well-defined size and connectivity are of interest for catalysis, chromatography and controlled release of drugs,…”
Get full text

A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille by Stump, Aaron

“…EPTCS 307, 2019, pp. 55-67 Cedille is a relatively recent tool based on a Curry-style pure type theory, without a primitive datatype system. Using novel…”
Get full text

Syntax and Typing for Cedille Core by Stump, Aaron

“…This document specifies a core version of the type theory implemented in the Cedille tool. Cedille is a language for dependently typed programming and…”
Get full text

Monotone recursive types and recursive data representations in Cedille by Jenkins, Christopher, Stump, Aaron

“…Math. Struct. Comp. Sci. 31 (2021) 682-745 Guided by Tarksi's fixpoint theorem in order theory, we show how to derive monotone recursive types with…”
Get full text

Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005) by Barrett, Clark, de Moura, Leonardo, Stump, Aaron

“…The Satisfiability Modulo Theories Competition (SMT-COMP) is intended to spark further advances in the decision procedures field, especially for applications…”
Get full text