Sciweavers

850 search results - page 1 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
TACS
2001
Springer
15 years 10 months ago
A Logic Programming Language Based on Binding Algebras
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
Makoto Hamana
158
Voted
ICALP
2001
Springer
15 years 10 months ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
Furio Honsell, Marino Miculan, Ivan Scagnetto
EWDW
1990
15 years 9 months ago
Semantics of Object-Oriented Data Models - The Evolving Algebra Approach
The formal description of the semantics of object-oriented data models is still an open problem. Some characteristic features of object-oriented data models, such as methods and i...
Georg Gottlob, Gerti Kappel, Michael Schrefl
ICLP
2007
Springer
15 years 11 months ago
Automatic Binding-Related Error Diagnosis in Logic Programs
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
Pawel Pietrzak, Manuel V. Hermenegildo
ICFP
2012
ACM
13 years 8 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook