We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
BSTRACTION, FUNCTION VARIABLES, AND SIMPLE UNIFICATION: Abstract Draft, 20 September 1989 Dale Miller Department of Computer and Information Science University of Pennsylvania Phil...
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...