Sciweavers

3535 search results - page 8 / 707
» Logic Program Specialisation
Sort
View
101
Voted
LOPSTR
2004
Springer
15 years 5 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
97
Voted
JFP
2006
89views more  JFP 2006»
14 years 11 months ago
Featherweight generic confinement
Existing approaches to object encapsulation and confinement either rely on restrictions to programs or require the use of specialised ownership type systems. Syntactic restriction...
Alex Potanin, James Noble, Dave Clarke, Robert Bid...
IJCAI
1993
15 years 1 months ago
An Analytic Learning System for Specializing Heuristics
This paper describes how meta-level theories are used for analytic learning in M U L T I - T A C . M U L T I - T A C operationalizes generic heuristics for constraint-satisfaction...
Steven Minton
WWW
2003
ACM
16 years 10 days ago
Description logic programs: combining logic programs with description logic
Benjamin N. Grosof, Ian Horrocks, Raphael Volz, St...
ICFP
2012
ACM
13 years 2 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens