Sciweavers

532 search results - page 89 / 107
» The Logic of Quasi-MV Algebras
Sort
View
LICS
2002
IEEE
15 years 6 months 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
FPCA
1989
15 years 5 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 1 months ago
A Homogeneous Reaction Rule Language for Complex Event Processing
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
Adrian Paschke, Alexander Kozlenkov, Harold Boley
FSS
2010
97views more  FSS 2010»
15 years 8 days ago
An early approach toward graded identity and graded membership in set theory
The paper considers an early approach toward a (fuzzy) set theory with a graded membership predicate and a graded equality relation which had been developed by the German mathemat...
Siegfried Gottwald
JSYML
2010
107views more  JSYML 2010»
15 years 5 days ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov