Sciweavers

APLAS
2007
ACM
13 years 8 months ago
Monadic, Prompt Lazy Assertions in Haskell
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
Olaf Chitil, Frank Huch
APLAS
2007
ACM
13 years 8 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
APLAS
2007
ACM
13 years 8 months ago
Adjunct Elimination in Context Logic for Trees
Abstract. We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not po...
Cristiano Calcagno, Thomas Dinsdale-Young, Philipp...
APLAS
2007
ACM
13 years 8 months ago
On a Tighter Integration of Functional and Logic Programming
The integration of functional and logic programming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: ...
Bernd Braßel, Frank Huch
APLAS
2007
ACM
13 years 8 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
APLAS
2007
ACM
13 years 8 months ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama
APLAS
2007
ACM
13 years 8 months ago
Mixed Inductive/Coinductive Types and Strong Normalization
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
Andreas Abel
APLAS
2007
ACM
13 years 8 months ago
Translation Correctness for First-Order Object-Oriented Pattern Matching
Pattern matching makes ML programs more concise and readable, and these qualities are also sought in object-oriented settings. However, objects and classes come with open erarchie...
Burak Emir, Qin Ma 0002, Martin Odersky
APLAS
2007
ACM
13 years 8 months ago
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Alwen Tiu