Sciweavers

479 search results - page 79 / 96
» The theory and calculus of aliasing
Sort
View
LISP
2006
105views more  LISP 2006»
13 years 7 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
PPDP
2010
Springer
13 years 6 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
ICFP
2007
ACM
14 years 7 months ago
A type system for recursive modules
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
Derek Dreyer
SAC
2010
ACM
14 years 2 months ago
Implementing software product lines using traits
A software product line (SPL) is a set of software systems with well-defined commonalities and variabilities that are developed by managed reuse of common artifacts. In this pape...
Lorenzo Bettini, Ferruccio Damiani, Ina Schaefer
IJCAI
1993
13 years 9 months ago
The Range of Applicability of Nonmonotonic Logics for the Inertia Problem
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
Erik Sandewall