Sciweavers

650 search results - page 32 / 130
» Logical Bisimulations and Functional Languages
Sort
View
ICFP
2010
ACM
14 years 11 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
DATESO
2007
107views Database» more  DATESO 2007»
15 years 9 days ago
Updating Typed XML Documents Using a Functional Data Model
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
Pavel Loupal
AGP
1997
IEEE
15 years 3 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
ICFP
1997
ACM
15 years 3 months ago
The Development of Erlang
This paper describes the development of the programming language Erlang during the period 1985-1997. Erlang is a concurrent programming language designed for programming large-sca...
Joe L. Armstrong
CONCUR
2010
Springer
14 years 12 months ago
Termination in Impure Concurrent Languages
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...