Sciweavers

10575 search results - page 1884 / 2115
» Programming Languages
Sort
View
ENTCS
2006
89views more  ENTCS 2006»
15 years 6 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
LISP
2008
104views more  LISP 2008»
15 years 6 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
ENTCS
2007
120views more  ENTCS 2007»
15 years 6 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
ENTCS
2007
98views more  ENTCS 2007»
15 years 6 months ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
CI
2004
125views more  CI 2004»
15 years 6 months ago
Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory
This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized d...
Tran Cao Son, Enrico Pontelli
« Prev « First page 1884 / 2115 Last » Next »