Sciweavers

3713 search results - page 111 / 743
» Constructing a Calculus of Programs
Sort
View
ICFP
2003
ACM
16 years 3 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
GPCE
2005
Springer
15 years 8 months ago
Model Compiler Construction Based on Aspect-Oriented Mechanisms
Naoyasu Ubayashi, Tetsuo Tamai, Shinji Sano, Yusak...
109
Voted
ACMSE
2008
ACM
15 years 5 months ago
A little language for surveys: constructing an internal DSL in Ruby
Using a problem domain motivated by Bentley's"Little Languages" column [1], this paper explores the use of the Ruby programming language's flexible syntax, dyn...
H. Conrad Cunningham
LPNMR
2009
Springer
15 years 9 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker
FSEN
2007
Springer
15 years 9 months ago
A Model of Component-Based Programming
Abstract. Component-based programming is about how to create application programs from prefabricated components with new software that provides both glue between the components, an...
Xin Chen, Jifeng He, Zhiming Liu, Naijun Zhan