Sciweavers

66 search results - page 1 / 14
» Rewriting Haskell Strings
Sort
View
76
Voted
PADL
2007
Springer
15 years 4 months ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy
97
Voted
ACL
2012
13 years 19 days ago
String Re-writing Kernel
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
Fan Bu, Hang Li, Xiaoyan Zhu
ENTCS
2008
89views more  ENTCS 2008»
14 years 10 months ago
Undecidable Properties on Length-Two String Rewriting Systems
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that both of termination and confluence for l...
Masahiko Sakai, Yi Wang
HASKELL
2006
ACM
15 years 4 months ago
Introducing the Haskell equational reasoning assistant
We introduce the new, improved version of the Haskell Equational Reasoning Assistant, which consists of an Ajax application for rewriting Haskell fragments in their context, and a...
Andy Gill
86
Voted
DSL
2009
14 years 8 months ago
A Haskell Hosted DSL for Writing Transformation Systems
KURE is a Haskell hosted Domain Specific Language (DSL) for writing transformation systems based on rewrite strategies. When writing transformation systems, a significant amount of...
Andy Gill