Sciweavers

4757 search results - page 7 / 952
» Monads for Functional Programming
Sort
View
AGP
1998
IEEE
13 years 11 months ago
Parsing with Non-Deterministic Functions
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
Rafael Caballero, Francisco Javier López-Fr...
AOSD
2012
ACM
12 years 3 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
POPL
1995
ACM
13 years 11 months ago
Monad Transformers and Modular Interpreters
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
Sheng Liang, Paul Hudak, Mark P. Jones
GI
2009
Springer
14 years 3 days ago
Reinventing Haskell Backtracking
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
Sebastian Fischer
APLAS
2006
ACM
14 years 1 months ago
Proof Abstraction for Imperative Languages
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
William L. Harrison