Sciweavers

3513 search results - page 252 / 703
» Super Logic Programs
Sort
View
ENTCS
2002
91views more  ENTCS 2002»
15 years 4 months ago
Subtyping in Logical Form
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
Ugo de'Liguoro
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICFP
2003
ACM
16 years 4 months ago
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
We report on work in progress devoted to the formalization of an Ordered Logical Framework (OLF) based on a two-level architecture [8] in the Hybrid system. OLF here is a second-or...
Alberto Momigliano, Jeff Polakow
APLAS
2005
ACM
15 years 10 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
AICOM
2006
105views more  AICOM 2006»
15 years 4 months ago
Evolutionary concept learning in First Order Logic: An overview
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a short description of the two popular ILP systems FOIL and Progol, we focus on meth...
Federico Divina