Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Strafunski

Strafunski is a functional programming-based toolset for implementing program analysis and transformation components. It is implemented in Haskell… Expand
Wikipedia

Related topics

Related topics

10 relations
ASF+SDF Meta-EnvironmentFunctional programmingHaskellParse tree
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
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… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
2009
2009
An Isabelle/HOL-based model of stratego-like traversal strategies
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom… Expand
  • figure 3
  • figure 2
  • figure 4
  • figure 5
  • figure 6
2009
2009
Programming errors in traversal programs over structured data
Traversal strategies a la Stratego (also a la Strafunski and 'Scrap Your Boilerplate') provide an exceptionally versatile and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2007
2007
Slicing wxHaskell modules to derive the User Interface Abstract Model
In this paper, we discuss an experience slicing an H skell program to separate its GUI developed with the graphic toolkit… Expand
2005
2005
Strategic Term Rewriting and Its Application to a VDMSL to SQL Conversion
We constructed a tool, called VooDooM, which converts datatypes in Vdm-sl into Sql relational data models. The conversion… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Review
2005
Review
2005
Programmable Rewriting Strategies in Haskell: -- White Paper --
  • R. Lämmel
  • Electron. Notes Theor. Comput. Sci.
  • 2005
    • Corpus ID: 12566598
Programmable rewriting strategies provide a valuable tool for implementing traversal functionality in grammar-driven (or schema… Expand
2004
2004
Calculate databases with `simplicity
Effort to replace “à la Codd” database schema design (normalization etc) by calculation based on simple (dually, injective… Expand
Highly Cited
2003
Highly Cited
2003
A Strafunski Application Letter
Strafunski is a Haskell-centred software bundle for implementing language processing components -- most notably program analyses… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2003
2003
A Strafunski Application Letter Sen Software Engineering a Strafunski Application Letter a Strafunski Application Letter
Strafunski is a Haskell-centred software bundle for implementing language processing components — most notably program analyses… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2002
2002
Strategic polymorphism requires just two combinators!
textabstractIn previous work, we introduced the notion of functional strategies: first-class generic functions that can traverse… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE