Simon L. Peyton Jones

Available identifiers

zbMath Open peyton-jones.simon-lDBLPj/SimonLPeytonJonesWikidataQ92949 ScholiaQ92949MaRDI QIDQ1818317

List of research outcomes

Publication	Date of Publication	Type
Codata in action	2023-11-24	Paper
pySecDec: a toolbox for the numerical evaluation of multi-scale integrals	2023-06-07	Paper
A GPU compatible quasi-Monte Carlo integrator interfaced to pySecDec	2023-04-14	Paper
Build systems à la carte: Theory and practice	2020-05-26	Paper
Composable scheduler activations for Haskell	2017-10-23	Paper
Safe zero-cost coercions for Haskell	2017-10-23	Paper
Modular, higher order cardinality analysis in theory and practice	2017-10-23	Paper
Associated types with class	2017-07-14	Paper
Sequent calculus as a compiler intermediate language	2017-05-10	Paper
SecDec-3.0: numerical evaluation of multi-scale integrals beyond one loop	2017-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q2958372	2017-02-01	Paper
Safe zero-cost coercions for Haskell	2016-09-29	Paper
Refinement types for Haskell	2016-09-29	Paper
A Reflection on Types	2016-08-17	Paper
Boxy types	2015-08-03	Paper
Static contract checking for Haskell	2015-07-03	Paper
Optimistic evaluation	2015-07-02	Paper
Exploiting vector instructions with generalized stream fusion	2015-03-30	Paper
Type checking with open type functions	2015-03-16	Paper
FPH	2015-03-16	Paper
Making a fast curry	2015-03-09	Paper
Scrap more boilerplate	2015-03-09	Paper
Regular, shape-polymorphic, parallel arrays in Haskell	2015-03-05	Paper
Scrap your boilerplate with class	2015-01-06	Paper
Associated type synonyms	2015-01-06	Paper
Runtime support for multicore Haskell	2015-01-06	Paper
Complete and decidable type inference for GADTs	2015-01-06	Paper
HALO	2014-11-27	Paper
Work efficient higher-order vectorisation	2014-07-21	Paper
Call-pattern specialisation for Haskell programs	2014-07-21	Paper
Backpack	2014-04-10	Paper
Modular, higher-order cardinality analysis in theory and practice	2014-04-10	Paper
Closed type families with overlapping equations	2014-04-10	Paper
Generative type abstraction and type-level computation	2014-04-10	Paper
Derivable Type Classes	2013-05-10	Paper
<scp>OutsideIn(X)</scp>Modular type inference with local assumptions	2013-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q3165976	2012-10-19	Paper
Fun with Type Functions	2010-10-26	Paper
Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine	2009-05-05	Paper
Scrap Your Type Applications	2008-08-28	Paper
A monadic framework for delimited continuations	2007-11-22	Paper
Programming Languages and Systems	2007-09-28	Paper
Lock Free Data Structures Using STM in Haskell	2007-05-02	Paper
Programming Languages and Systems	2007-05-02	Paper
Practical type inference for arbitrary-rank types	2007-02-07	Paper
Understanding functional dependencies via constraint handling rules	2007-02-07	Paper
Making a fast curry: push/enter vs. eval/apply for higher-order languages	2006-08-28	Paper
Constructed product result analysis for Haskell	2004-09-24	Paper
https://portal.mardi4nfdi.de/entity/Q2767981	2002-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q2763985	2002-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q2763390	2002-01-15	Paper
Secrets of the Glasgow Haskell Compiler inliner	2002-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4499187	2001-03-06	Paper
A transformation-based optimiser for Haskell	2000-01-04	Paper
https://portal.mardi4nfdi.de/entity/Q4692880	1993-06-05	Paper
A safe approach to parallel combinator reduction	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3713568	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3741018	1986-01-01	Paper
Yacc in sasl — an exercise in functional programming	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3685169	1985-01-01	Paper

Research outcomes over time

This page was built for person: Simon L. Peyton Jones