Sciweavers

143 search results - page 28 / 29
» An axiomatic approach to algebrization
Sort
View
RTA
2005
Springer
14 years 1 months ago
The Algebra of Equality Proofs
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
Aaron Stump, Li-Yang Tan
LICS
2002
IEEE
14 years 13 days ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
CONTEXT
1999
Springer
13 years 11 months ago
Contexts, Domains, and Software
We survey some issues that relate to context dependence and context sensitivity in the development of software, particularly in relation to information systems by defining a range...
Alfs T. Berztiss
FOSSACS
1999
Springer
13 years 11 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
CCA
2009
Springer
13 years 11 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi