Sciweavers

764 search results - page 85 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
PLSA
1994
15 years 3 months ago
Language and Architecture Paradigms as Object Classes
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
Diomidis Spinellis, Sophia Drossopoulou, Susan Eis...
IPPS
2000
IEEE
15 years 4 months ago
Declarative Concurrency in Java
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. The language allows the programmer to declaratively...
Rafael Ramirez, Andrew E. Santosa
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
15 years 3 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
ENTCS
2007
120views more  ENTCS 2007»
14 years 11 months ago
A Framework for Interpreting Traces of Functional Logic Computations
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Bernd Braßel
ICFP
2010
ACM
15 years 28 days ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen