A survey of rewriting strategies in program transformation systems
E Visser - Electronic Notes in Theoretical Computer Science, 2001 - Elsevier
Program transformation is used in a wide range of applications including compiler
construction, optimization, program synthesis, refactoring, software renovation, and reverse …
construction, optimization, program synthesis, refactoring, software renovation, and reverse …
Grammatical framework
A Ranta - Journal of Functional Programming, 2004 - cambridge.org
Grammatical Framework (GF) is a special-purpose functional language for defining
grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to …
grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to …
Type classes with functional dependencies
MP Jones - European Symposium on Programming, 2000 - Springer
Type classes in Haskell allow programmers to define functions that can be used on a set of
different types, with a potentially different implementation in each case. For example, type …
different types, with a potentially different implementation in each case. For example, type …
Frappé: Functional reactive programming in Java
A Courtney - International Symposium on Practical Aspects of …, 2001 - Springer
Abstract Functional Reactive Programming (FRP) is a declarative programming model for
constructing interactive applications based on a continuous model of time. FRP programs …
constructing interactive applications based on a continuous model of time. FRP programs …
Typing linear algebra: A biproduct-oriented approach
HD Macedo, JN Oliveira - Science of Computer Programming, 2013 - Elsevier
Interested in formalizing the generation of fast running code for linear algebra applications,
the authors show how an index-free, calculational approach to matrix algebra can be …
the authors show how an index-free, calculational approach to matrix algebra can be …
[PDF][PDF] Typing haskell in haskell
MP Jones - Haskell workshop, 1999 - archive.alvb.in
Haskell benefits from a sophisticated type system, but implementors, programmers, and
researchers suffer because it has no formal description. To remedy this shortcoming, we …
researchers suffer because it has no formal description. To remedy this shortcoming, we …
Monads for incremental computing
M Carlsson - Proceedings of the seventh ACM SIGPLAN …, 2002 - dl.acm.org
This paper presents a monadic approach to incremental computation, suitable for purely
functional languages such as Haskell. A program that uses incremental computation is able …
functional languages such as Haskell. A program that uses incremental computation is able …
[图书][B] Vorlesungen über Informatik: Band 1: Grundlagen und funktionales Programmieren
G Goos - 2013 - books.google.com
Dieses Lehrbuch ist eine moderne Einführung in die Informatik für das Grundstudium an
Universitäten und Fachhochschulen. Der Autor stellt die Prinzipien der" …
Universitäten und Fachhochschulen. Der Autor stellt die Prinzipien der" …
[PDF][PDF] Off-line signature verification using directional PDF and neural networks
R Sabourin, JP Drouhard - Proceedings of the 11th ICPR, The Hague, 1992 - en.etsmtl.ca
Die first stage of a complete Automatic Handwritten Signature Verification System (AHSVS)
is described in this paper. Since only random forgeries are taken into account in this first …
is described in this paper. Since only random forgeries are taken into account in this first …
Functional morphology
M Forsberg, A Ranta - ACM SIGPLAN Notices, 2004 - dl.acm.org
This paper presents a methodology for implementing natural language morphology in the
functional language Haskell. The main idea behind is simple: instead of working with …
functional language Haskell. The main idea behind is simple: instead of working with …