Sciweavers

238 search results - page 6 / 48
» Program Abstraction in a Higher-Order Logic Framework
Sort
View
JELIA
1990
Springer
14 years 19 days ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
PLILP
1993
Springer
14 years 20 days ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
TOCL
2008
128views more  TOCL 2008»
13 years 8 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
META
1992
14 years 20 days ago
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
Maurice Bruynooghe, Gerda Janssens
PADL
2004
Springer
14 years 1 months ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...