Sciweavers

636 search results - page 81 / 128
» Operational Semantics for Functional Logic Languages
Sort
View
ICFP
2003
ACM
14 years 8 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
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 2 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
ESWS
2006
Springer
14 years 11 days ago
Matching Semantic Service Descriptions with Local Closed-World Reasoning
Abstract. Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the se...
Stephan Grimm, Boris Motik, Chris Preist
SCAM
2006
IEEE
14 years 2 months ago
SMART C: A Semantic Macro Replacement Translator for C
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
Matthew Jacobs, E. Christopher Lewis
ICLP
2009
Springer
14 years 9 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin