412 search results - page 8 / 83 » Innovations in computational type theory using Nuprl |
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
BCSHCI
2009
13 years 5 months ago
2009
This paper reflects on the views of the human that were oriented to in two distinct research labs and which have been used to populate an inventive landscape over the past twenty ...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...