Sciweavers

134 search results - page 8 / 27
» An Algebraic View of Program Composition
Sort
View
ENTCS
2002
125views more  ENTCS 2002»
13 years 9 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
ICFP
1996
ACM
14 years 2 months ago
A Theory of Weak Bisimulation for Core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
William Ferreira, Matthew Hennessy, Alan Jeffrey
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
14 years 1 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira
AGP
1994
IEEE
14 years 1 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
SAIG
2001
Springer
14 years 2 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann