111 search results - page 4 / 23 » A Proof of Strong Normalisation using Domain Theory |
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...
MST
2007
13 years 7 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
PPDP
2005
Springer
14 years 27 days ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...