Sciweavers

39 search results - page 1 / 8
» Compiling pattern matching to good decision trees
Sort
View
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 3 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
POPL
2009
ACM
14 years 4 months ago
Focusing on pattern matching
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
Neelakantan R. Krishnaswami
IFIP
2004
Springer
13 years 9 months ago
Regular Tree Language Recognition with Static Information
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
Alain Frisch
JFP
2006
113views more  JFP 2006»
13 years 3 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
CC
2003
Springer
103views System Software» more  CC 2003»
13 years 8 months ago
A Pattern Matching Compiler for Multiple Target Languages
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
Pierre-Etienne Moreau, Christophe Ringeissen, Mari...