The typechecking of programs with implicit type structure.
Proc. of the international symposium on Semantics of data types
Detecting global variables in denotational specifications
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Are applicative languages inefficient?
ACM SIGPLAN Notices
Type inference for polymorphic references
Information and Computation
ML for the working programmer
Assignments for applicative languages
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Unboxed values as first class citizens in a non-strict functional language
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Call by name, assignment, and the lambda calculus
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Imperative functional programming
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Integrating functional and imperative programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Conventional and Uniqueness Typing in Graph Rewrite Systems
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Second-Order Logical Relations (Extended Abstract)
Proceedings of the Conference on Logic of Programs
Isolating side effects in sequential languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Structuring depth-first search algorithms in Haskell
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics of barriers in a non-strict, implicitly-parallel language
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type specialisation for imperative languages
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Monadic state: axiomatization and type safety
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
ACM Computing Surveys (CSUR)
Rolling your own mutable ADT—a connection between linear types and monads
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
First-class polymorphism with type inference
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Correctness of monadic state: an imperative call-by-need calculus
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The marriage of effects and monads
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
On embedding a microarchitectural design language within Haskell
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Program analysis for safety guarantees in a Java virtual machine written in Java
PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Generic unification via two-level types and parameterized modules
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Monads for incremental computing
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
The marriage of effects and monads
ACM Transactions on Computational Logic (TOCL)
Safe and Principled Language Interoperation
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Concurrent Monadic Interfacing
IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Cycle therapy: a prescription for fold and unfold on regular trees
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Single Assignment C: efficient support for high-level array operations in a functional setting
Journal of Functional Programming
Journal of Functional Programming
Monadic encapsulation of effects: a revised approach (extended version)
Journal of Functional Programming
Forms/3: A first-order visual language to explore the boundaries of the spreadsheet paradigm
Journal of Functional Programming
ACM SIGPLAN Notices
Two-level types and parameterized modules
Journal of Functional Programming
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Functional pearl: implicit configurations--or, type classes reflect the values of types
Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Modelling deterministic concurrent I/O
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Structured formal development in Isabelle
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Journal of Functional Programming
Experience report: a pure shirt fits
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Imperative Functional Programming with Isabelle/HOL
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Typed transformations of typed abstract syntax
Proceedings of the 4th international workshop on Types in language design and implementation
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Term transformers: A new approach to state
ACM Transactions on Programming Languages and Systems (TOPLAS)
The lambda-context calculus (extended version)
Information and Computation
Implementation of an Orchestration Language as a Haskell Domain Specific Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Witnessing Purity, Constancy and Mutability
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Regular, shape-polymorphic, parallel arrays in Haskell
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Information flow enforcement in monadic libraries
Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Non-monadic models of mutable references
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Efficient parallel stencil convolution in Haskell
Proceedings of the 4th ACM symposium on Haskell
A monad for deterministic parallelism
Proceedings of the 4th ACM symposium on Haskell
Purely functional lazy nondeterministic programming
Journal of Functional Programming - Dedicated to ICFP 2009
Combining datatypes and effects
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
The brisk project: concurrent and distributed functional systems
FP'95 Proceedings of the 1995 international conference on Functional Programming
Wormholes: introducing effects to FRP
Proceedings of the 2012 Haskell Symposium
Taming non-compositionality using new binders
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Using relations to develop a haskell program for computing maximum bipartite matchings
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
A flow-insensitive, modular effect system for purity
Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs
Typed syntactic meta-programming
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Productive coprogramming with guarded recursion
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Data flow fusion with series expressions in Haskell
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
An EDSL approach to high performance Haskell programming
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
| Hi-index | 0.00 |
Some algorithms make critical internal use of updatable state, even though their external specification is purely functional. Based on earlier work on monads, we present a way of securely encapsulating stateful computations that manipulate multiple, named, mutable objects, in the context of a non-strict, purely-functional language.The security of the encapsulation is assured by the type system, using parametricity. Intriguingly, this parametricity requires the provision of a (single) constant with a rank-2 polymorphic type.