S
Simon Peyton-Jones
Researcher at Microsoft
Publications - 19
Citations - 1622
Simon Peyton-Jones is an academic researcher from Microsoft. The author has contributed to research in topics: Haskell & Context (language use). The author has an hindex of 12, co-authored 19 publications receiving 1586 citations.
Papers
More filters
Proceedings ArticleDOI
Composable memory transactions
TL;DR: This paper presents a new concurrency model, based on transactional memory, that offers far richer composition, and describes new modular forms of blocking and choice that have been inaccessible in earlier work.
Proceedings ArticleDOI
Refinement types for Haskell
TL;DR: A stratified type system that labels binders as potentially diverging or not, and that (circularly) uses refinement types to verify the labeling, that is able to prove 96% of all recursive functions terminating, while requiring a modest 1.7 lines of termination-annotations per 100 lines of code.
Proceedings ArticleDOI
Towards Haskell in the cloud
TL;DR: Cloud Haskell is presented, a domain-specific language for developing programs for a distributed computing environment that provides a message-passing communication model, inspired by Erlang, without introducing incompatibility with Haskell's established shared-memory concurrency.
Proceedings ArticleDOI
Roadmap for enhanced languages and methods to aid verification
Gary T. Leavens,Jean-Raymond Abrial,Don Batory,Michael Butler,Alessandro Coglio,Kathi Fisler,Eric C. R. Hehner,Cliff B. Jones,Dale Miller,Simon Peyton-Jones,Murali Sitaraman,Douglas R. Smith,Aaron Stump +12 more
TL;DR: This roadmap describes ways that researchers in four areas---specification languages, program generation, correctness by construction, and programming languages---might help further the goal of verified software.
Journal ArticleDOI
Understanding functional dependencies via constraint handling rules
TL;DR: This work gives a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs) to provide for the first time a concise result that under some sufficient conditions, functional dependencies allow for sound, complete and decidable type inference.