Sciweavers

314 search results - page 10 / 63
» A Framework for Interpreting Traces of Functional Logic Comp...
Sort
View
LPAR
1999
Springer
14 years 25 days ago
A Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
Elvira Albert, María Alpuente, Michael Hanu...
ICALP
2011
Springer
13 years 19 hour ago
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
Silvia Crafa, Francesco Ranzato
MFCS
2001
Springer
14 years 1 months ago
Computable Versions of Baire's Category Theorem
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
Vasco Brattka
ICML
1989
IEEE
14 years 18 days ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
FCT
2005
Springer
14 years 2 months ago
On the Expressiveness of Asynchronous Cellular Automata
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
Benedikt Bollig