Sciweavers

1406 search results - page 81 / 282
» Similarity in Programs
Sort
View
TLCA
2007
Springer
15 years 4 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani
CC
2010
Springer
155views System Software» more  CC 2010»
15 years 4 months ago
Preference-Guided Register Assignment
Abstract. This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally conside...
Matthias Braun, Christoph Mallon, Sebastian Hack
ML
2006
ACM
122views Machine Learning» more  ML 2006»
14 years 9 months ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant
SEKE
2005
Springer
15 years 3 months ago
An Empirical Study on Limits of Clone Unification Using Generics
Generics (templates) attempt to unify similar program structures to avoid redundancy. How well do generics serve this purpose in practice? We try to answer this question through e...
Hamid Abdul Basit, Damith C. Rajapakse, Stan Jarza...
APLAS
2004
ACM
15 years 3 months ago
Build, Augment and Destroy, Universally
Abstract. We give a semantic footing to the fold/build syntax of programming with inductive types, covering shortcut deforestation, based on a universal property. Specifically, we...
Neil Ghani, Tarmo Uustalu, Varmo Vene