33 search results - page 7 / 7 » Coincidences Are not Accidental: a Theorem |
LICS
2002
IEEE
14 years 16 days ago
2002
IEEE
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...
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
13 years 7 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
JFP
2000
13 years 7 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...