Sciweavers

239 search results - page 16 / 48
» Partial Evaluation of Functional Logic Programs
Sort
View
AAAI
1996
13 years 8 months ago
Splitting a Default Theory
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
Hudson Turner
PADL
2005
Springer
14 years 26 days ago
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
Qian Wang, Gopal Gupta, Michael Leuschel
ICFP
2002
ACM
14 years 7 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
VLDB
1991
ACM
128views Database» more  VLDB 1991»
13 years 11 months ago
A Functional Programming Approach to Deductive Databases
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
Alexandra Poulovassilis, Carol Small
ICFP
2002
ACM
14 years 7 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski