Sciweavers

54 search results - page 8 / 11
» Constructing language processors with algebra combinators
Sort
View
POPL
2007
ACM
15 years 9 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano
98
Voted
MEMOCODE
2003
IEEE
15 years 2 months ago
Bridging CSP and C++ with Selective Formalism and Executable Specifications
CSP (Communicating Sequential Processes) is a useful algebraic notation for creating a hierarchical behavioural specification for concurrent systems, due to its formal interproces...
William B. Gardner
POPL
2009
ACM
15 years 10 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
79
Voted
FOIS
2006
14 years 11 months ago
Formalizing Ontology Alignment and its Operations with Category Theory
An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the te...
Antoine Zimmermann, Markus Krötzsch, Jé...
FUIN
2010
137views more  FUIN 2010»
14 years 6 months ago
Extending and Implementing RASP
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...
Stefania Costantini, Andrea Formisano, Davide Pett...