Simon L. Peyton Jones
Artificial Intelligence · ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming · 2002–2007
A researcher in the Science corpus: 4 papers; trusts 3 researchers and is trusted by 8 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 5 citations into it; #16,371 of 35,345 by trust here, #28,481 by citations
Whom Simon L. Peyton Jones trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Simon L. Peyton Jones overall
Papers from Simon L. Peyton Jones's perspective
Ordered by how strongly the researchers Simon L. Peyton Jones trusts endorse each paper. Same corpus, a different order for every researcher.
- de Bruijn notation as a nested datatype
- Purely functional data structures
- Composable memory transactions (ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming)
- Language support for lightweight transactions (Conference on Object-Oriented Programming Systems, Languages, and Applications)
- Software transactional memory for dynamic-sized data structures (ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing)
- Types and programming languages: the next generation (18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.)
- Executing a Program on the MIT Tagged-Token Dataflow Architecture
- Packrat parsing:: simple, powerful, lazy, linear time, functional pearl (ACM SIGPLAN International Conference on Functional Programming)
- Generalising monads to arrows (Science of Computer Programming)
- QuickCheck: a lightweight tool for random testing of Haskell programs (ACM SIGPLAN International Conference on Functional Programming)
Their papers
- Template meta-programming for Haskell (2002) — 583 citations
- A history of Haskell: being lazy with class (2007) — 342 citations
- Composable memory transactions (2005) — 836 citations
- Scrap your boilerplate: a practical design pattern for generic programming (2003) — 396 citations