Strictness analysis using abstract reduction
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Benchmarking implementations of lazy functional languages
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
The game of life: a CLEAN programming tutorial and case study
ACM SIGPLAN Notices
Efficient execution of programs with static semantics
ACM SIGPLAN Notices
The functional side of logic programming
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Generation of formatters for context-free languages
ACM Transactions on Software Engineering and Methodology (TOSEM)
A systematic study of functional language implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
One-bit counts between unique and sticky
Proceedings of the 1st international symposium on Memory management
Linear behaviour of term graph rewriting programs
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Coordinating functional processes with Haskell#
Proceedings of the 2002 ACM symposium on Applied computing
The narrowing-driven approach to functional logic program specialization
New Generation Computing - Partial evaluation and program transformation
Context-sensitive rewriting strategies
Information and Computation
Keep it clean: a unique approach to functional programming.
ACM SIGPLAN Notices
Application of the Polytope Model to Functional Programs
LCPC '99 Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing
EROC: A Toolkit for Building NEATO Query Optimizers
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Parallel Admissible Graph Rewriting
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Condensed Graphs: A Multi-level, Parallel, Intermediate Representation
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Term Graph Rewriting and Mobile Expressions in Functional Languages
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Strictness Analysis as Finite-Domain Constraint Solving
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Performance Results for an Implementation of the Process Coordination Language K2
IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Dynamic Types and Type Dependent Functions
IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Implementing Eden - or: Dreams Become Reality
IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Porting the Clean Object I/O Library to Haskell
IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Facilitating Parallel Programming in PVM Using Condensed Graphs
Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Single Assignment C: efficient support for high-level array operations in a functional setting
Journal of Functional Programming
Journal of Functional Programming
A competitive algorithm for managing sharing in the distributed execution of functional programs
Journal of Functional Programming
Strong and NV-sequentiality of constructor systems
Information Processing Letters
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Polymorphic algebraic data type reconstruction
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Rewriting term-graphs with priority
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
On modularity in infinitary term rewriting
Information and Computation
Modelling deterministic concurrent I/O
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
Removing redundant arguments automatically
Theory and Practice of Logic Programming
From Functional Programs to Interaction Nets via the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of Lazy Rewriting Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
On Term-Graph Rewrite Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Properties of Lazy Functional Programs with Sparkle
Central European Functional Programming School
An Introduction to the Lambda Calculus
Central European Functional Programming School
Central European Functional Programming School
From Interpretation to Compilation
Central European Functional Programming School
From Outermost Termination to Innermost Termination
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Termination of Priority Rewriting
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Recursive Functions with Pattern Matching in Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics
Electronic Notes in Theoretical Computer Science (ENTCS)
Programming with singular and plural non-deterministic functions
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
On modularity in infinitary term rewriting
Information and Computation
When generic functions use dynamic values
IFL'02 Proceedings of the 14th international conference on Implementation of functional languages
Towards a strongly typed functional operating system
IFL'02 Proceedings of the 14th international conference on Implementation of functional languages
Abstract diagnosis of functional programs
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
Exchanging sources between clean and Haskell: a double-edged front end for the clean compiler
Proceedings of the third ACM Haskell symposium on Haskell
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
An effective methodology for defining consistent semantics of complex systems
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Three syntactic theories for combinatory graph reduction
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Proceedings of the fifth international workshop on High-level parallel programming and applications
A functional shell that operates on typed and compiled applications
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Bimonadic semantics for basic pattern matching calculi
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Encoding strategies in the lambda calculus with interaction nets
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Proof tool support for explicit strictness
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Sharing in the graph rewriting calculus
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
FP'95 Proceedings of the 1995 international conference on Functional Programming
Trends in Trends in Functional Programming 1999/2000 versus 2007/2008
Higher-Order and Symbolic Computation
Functional high performance financial IT: the hiperfit research center in copenhagen
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
A strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Haskell vs. f# vs. scala: a high-level language features and parallelism support comparison
Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing
A Convex Powerdomain over Lattices: its Logic and λ-Calculus
Fundamenta Informaticae
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
Hoare-Style Verification of Graph Programs
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Three syntactic theories for combinatory graph reduction
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.01 |
From the Publisher:The descriptive power and semantic elegance of modern functional languages make it possible to develop correct programs relatively quickly. Efficient implementations of functional languages, employing graph rewriting techniques, have only recently become available. This book illustrates the techniques of functional programming in Miranda and Clean, and focuses on the computational model of Graph Rewriting Systems for both sequential and parallel machines. Highlights of the book include a clear tutorial guide to functional programming in Miranda and Clean, in-depth coverage of implementation on both sequential and parallel machines, and unique focus on Graph Rewriting Systems as a computational model. The book will be equally valuable for students taking courses in functional programming, and for programmers or systems designers who are keen to explore state-of-the-art programming and implementation techniques. The Concurrent Clean System, which is available from the authors, offers the opportunity to write both sequential and parallel applications (including window-based systems) in a pure, lazy functional language.