Sciweavers

176 search results - page 3 / 36
» Full Abstraction for Functional Languages with Control
Sort
View
TLCA
2005
Springer
15 years 3 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
73
Voted
BIRTHDAY
1997
Springer
15 years 1 months ago
Controlled Fuzzy Parallel Rewriting
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzz...
Peter R. J. Asveld
DAGSTUHL
2003
14 years 11 months ago
PiLib: A Hosted Language for Pi-Calculus Style Concurrency
Abstract. PiLib is a library written in Scala that implements the concurrency constructs of the π-calculus. Some features of the programming language Scala, examined in the paper,...
Vincent Cremet, Martin Odersky
ICFP
2003
ACM
15 years 9 months ago
A theory of aspects
This paper define the semantics of MinAML, an idealized aspect-oriented programming language, by giving a typedirected translation from its user-friendly external language to its ...
David Walker, Steve Zdancewic, Jay Ligatti
ICFP
2010
ACM
14 years 9 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic