Sciweavers

11397 search results - page 54 / 2280
» A Relational Abstraction for Functions
Sort
View
ITP
2010
172views Mathematics» more  ITP 2010»
14 years 1 months ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau
JSYML
2006
62views more  JSYML 2006»
13 years 10 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller
AI
2011
Springer
13 years 5 months ago
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
ating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties Nikos Gorogiannisa , Anthony Hunterb,∗ aDepartment of Computer Science, Queen Mary, Univers...
Nikos Gorogiannis, Anthony Hunter
ORDER
2006
105views more  ORDER 2006»
13 years 10 months ago
Descending Chains and Antichains of the Unary, Linear, and Monotone Subfunction Relations
The C-subfunction relations on the set of functions on a finite base set A defined by function classes C are examined. For certain clones C on A, it is determined whether the part...
Erkko Lehtonen
POPL
2006
ACM
14 years 10 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer