CIE
2008
Springer
13 years 10 months ago
2008
Springer
The extraction mechanism of Coq allows one to transform Coq proofs and functions into functional programs. We illustrate the behavior of this tool by reviewing several variants of ...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
We revisit Girard's reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called eliminati...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
We show how different functional interpretations can be combined via a multi-modal linear logic. A concrete hybrid of Kreisel's modified realizability and G
CIE
2008
Springer
13 years 10 months ago
2008
Springer
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
CF
2008
ACM
13 years 10 months ago
2008
ACM
CF
2008
ACM
13 years 10 months ago
2008
ACM
PRAM (Parallel Random Access Model) has been widely regarded a desirable parallel machine model for many years, but it is also believed to be "impossible in reality." As...