Cinnamons: A Computation Model Underlying Control Network Programming
, 2017 We give the easily recognizable name "cinnamon" and "cinnamon programming" to a new computation model intended to form a theoretical foundation for Control Network Programming (CNP).
Kratchanov, Kostadin
core +1 more source
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures [PDF]
, 2007 International audienceWe present an observational semantics for lambda(fut), a concurrent lambda calculus with reference cells and futures. The calculus lambda(fut) models the operational semantics of the concurrent higher-order programming language ...
Niehren, Joachim +3 more
core +2 more sources
Phobos: A front-end approach to extensible compilers (long version) [PDF]
, 2002 This paper describes a practical approach for implementing certain types of domain-specific languages with extensible compilers. Given a compiler with one or more front-end languages, we introduce the idea of a "generic" front-end that allows the ...
Granicz, Adam, Hickey, Jason
core +2 more sources
Probabilistic Logic Programming with Beta-Distributed Random Variables
, 2018 We enable aProbLog---a probabilistic logical programming approach---to reason in presence of uncertain probabilities represented as Beta-distributed random variables. We achieve the same performance of state-of-the-art algorithms for highly specified and
Cerutti, Federico +3 more
core +2 more sources
An Embedded Rule-Based Diagnostic Expert System in Ada [PDF]
Ada is becoming an increasingly popular programming language for large Government-funded software projects. Ada with it portability, transportability, and maintainability lends itself well to today's complex programming environment.
Jones, Robert E., Liberman, Eugene M.
core +1 more source
On generic context lemmas for lambda calculi with sharing [PDF]
, 2007 This paper proves several generic variants of context lemmas and thus contributes to improving the tools to develop observational semantics that is based on a reduction semantics for a language.
Sabel, David, Schmidt-Schauß, Manfred
core +2 more sources
Realising nondeterministic I/O in the Glasgow Haskell Compiler [PDF]
, 2003 In this paper we demonstrate how to relate the semantics given by the nondeterministic call-by-need calculus FUNDIO [SS03] to Haskell. After introducing new correct program transformations for FUNDIO, we translate the core language used in the Glasgow ...
Sabel, David
core +1 more source
Graphical workstation capability for reliability modeling [PDF]
In addition to computational capabilities, software tools for estimating the reliability of fault-tolerant digital computer systems must also provide a means of interfacing with the user.
Bavuso, Salvatore J. +2 more
core +1 more source
Beta-Testing the “Particular Machine”: The Machine-or-Transformation Test in Peril and Its Impact on Cloud Computing [PDF]
, 2012 This Issue Brief examines recent cases addressing the patent eligibility of computer-implemented method claims and their implications for the development of cloud computing technologies.
Lee, Richard M.
core +1 more source
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec [PDF]
, 2006 We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped with contextual equivalence the call-by-name and the call-by-need evaluation are equivalent, and also that the unrestricted copy-operation is correct ...
Schmidt-Schauß, Manfred
core +2 more sources