Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Message-based functional operating systems
Science of Computer Programming
An approach to functional operating systems
Research topics in functional programming
Imperative functional programming
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Semantic Lego
Control flow semantics
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Programming languages as operating systems (or revenge of the son of the lisp machine)
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Coalgebras and monads in the semantics of java
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Categories of Processes Enriched in Final Coalgebras
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Interactive Programs in Dependent Type Theory
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Continuation-based multiprocessing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Concurrent and Distributed Functional Systems
Concurrent and Distributed Functional Systems
The design and implementation of an operating system in a functional language (miranda)
The design and implementation of an operating system in a functional language (miranda)
Modular monadic semantics and compilation
Modular monadic semantics and compilation
A study of evaluation order semantics in expressions with side effects
Journal of Functional Programming
A poor man's concurrency monad
Journal of Functional Programming
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Achieving Information Flow Security through Precise Control of Effects
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Towards a strongly typed functional operating system
IFL'02 Proceedings of the 14th international conference on Implementation of functional languages
The SwitchWare active network architecture
IEEE Network: The Magazine of Global Internetworking
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Asynchronous Exceptions as an Effect
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Functional metamodels for systems and software
Journal of Systems and Software
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Achieving information flow security through monadic control of effects
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
A coinductive calculus for asynchronous side-effecting processes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Implementing a high-level distributed-memory parallel haskell in haskell
IFL'11 Proceedings of the 23rd international conference on Implementation and Application of Functional Languages
The confinement problem in the presence of faults
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
A coinductive calculus for asynchronous side-effecting processes
Information and Computation
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This article demonstrates how a powerful and expressive abstraction from concurrency theory—monads of resumptions—plays a dual rôle as a programming tool for concurrent applications. The article demonstrates how a wide variety of typical OS behaviors may be specified in terms of resumption monads known heretofore exclusively in the literature of programming language semantics. We illustrate the expressiveness of the resumption monad with the construction of an exemplary multitasking kernel in the pure functional language Haskell.