Sciweavers

313 search results - page 38 / 63
» Formalizing the Halting Problem in a Constructive Type Theor...
Sort
View
SIGSOFT
2009
ACM
14 years 8 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory
ICFP
2010
ACM
13 years 7 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
ICFP
2007
ACM
14 years 7 months ago
Type-safe higher-order channels in ML-like languages
As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. ...
Sungwoo Park
SAC
2009
ACM
14 years 2 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
AAMAS
2008
Springer
13 years 7 months ago
Agents that argue and explain classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent/incomplete/uncertain knowledge, based on the construction and the comparison of ar...
Leila Amgoud, Mathieu Serrurier