52 search results - page 8 / 11 » The Generalised Substitution Language Extended to Probabilis... |
ICFP
2000
ACM
15 years 4 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
174
Voted
POPL
2005
ACM
16 years 1 days ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
104
click to vote
LPNMR
1993
Springer
15 years 3 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
ECOOP
1998
Springer
15 years 4 months ago
1998
Springer
In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System d...
GPCE
2004
Springer
15 years 5 months ago
2004
Springer
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...