171 search results - page 6 / 35 » Classical Logic, Continuation Semantics and Abstract Machine... |
SBIA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
AML
2002
14 years 9 months ago
2002
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...
FLOPS
2004
Springer
15 years 2 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
ENTCS
2007
14 years 9 months ago
2007
Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Par...
107
Voted
IWFM
1998
14 years 10 months ago
1998
ing Structured Database Schemas into Abstract Machines Brian Matthews Rutherford Appleton Laboratory, Didcot, OXON, OX11 OQX, U.K. Elvira Locuratolo Istituto di Elaborazione dell&#...