Sciweavers

1131 search results - page 62 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
WCFLP
2005
ACM
15 years 10 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
MICAI
2007
Springer
15 years 10 months ago
On Reachability of Minimal Models of Multilattice-Based Logic Programs
In this paper some results are obtained regarding the existence and reachability of minimal fixed points for multiple-valued functions on a multilattice. The concept of inf-preser...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
IEICET
2007
110views more  IEICET 2007»
15 years 4 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
APLAS
2010
ACM
15 years 4 months ago
A Logical Mix of Approximation and Separation
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 10 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...