Samson Abramsky
Guy McCusker
1996
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions
Electr. Notes Theor. Comput. Sci
3
2–14
10.1016/S1571-0661(05)80398-6
Thorsten Altenkirch
James Chapman
Tarmo Uustalu
2015
Monads need not be endofunctors
Logical Methods in Computer Science
11
1
10.2168/LMCS-11(1:3)2015
Robert Atkey
2009
Parameterised Notions of Computation
J. Functional Programming
19
3–4
335–376
10.1145/158511.158524
Phil Bagwell
2002
Fast Functional Lists, Hash-Lists, Deques and Variable Length Arrays
Technical Report
EPFL
http://infoscience.epfl.ch/record/52465
Bernd Braßel
Michael Hanus
Björn Peemöller
Fabian Reck
2011
KiCS2: A New Compiler from Curry to Haskell
Functional and Constraint Logic Programming - 20th International Workshop, WFLP 2011, Odense, Denmark, July 19th, Proceedings
Lecture Notes in Computer Science
6816
Springer
1–18
10.1007/978-3-642-22531-4_1
Stanley Burris
H. P. Sankappanavar
1981
A Course in Universal Algebra
Graduate Texts in Mathematics
78
Springer, New York
10.1007/978-1-4613-8130-3
http://www.math.uwaterloo.ca/~snburris/htdocs/UALG/univ-algebra2012.pdf
Jacques Carette
Oleg Kiselyov
2011
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code
Science of Computer Programming
76
5
349–375
10.1016/j.scico.2008.09.008
Alonzo Church
1940
A Formulation of the Simple Theory of Types
Journal of Symbolic Logic
5
2
56–68
10.2307/2267254
Melvin E. Conway
1963
Design of a separable transition-diagram compiler
Commun. ACM
6
7
396–408
10.1145/366663.366704
Patrick Cousot
Radhia Cousot
1977
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints
Fourth ACM Symposium on Principles of Programming Language, Los Angeles
ACM Press, New York
238–252
Matt Fairtlough
Michael Mendler
1997
Propositional Lax Logic
Information and Computation
137
1
1–33
10.1006/inco.1997.2627
Sebastian Fischer
Oleg Kiselyov
Chung-chieh Shan
2011
Purely Functional Lazy Nondeterministic Programming
Journal of Functional Programming
21
4–5
413–465
10.1016/S0049-237X(08)72018-4
Joseph A. Goguen
1988
Higher Order Functions Considered Unnecessary for Higher Order Programming
Technical Report
SRI-CSL-88-1
Computer Science Laboratory, SRI International
M. Gordon
R. Milner
L. Morris
M. Newey
C. Wadsworth
1978
A Metalanguage for Interactive Proof in LCF
Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages
ACM SIGACT-SIGPLAN
Tucson, Arizona
119–130
http://www-public.tem-tsp.eu/~gibson/Teaching/CSC4504/ReadingMaterial/GordonMMNW78.pdf
Michael Hanus
2006
Curry: An Integrated Functional Logic Language (Vers. 0.8.2)
http://www.curry-language.org
Robert Harper
2017
Commentary on Practical Foundations for Programming Languages (Second Edition)
http://www.cs.cmu.edu/~rwh/pfpl/commentary.pdf
Robert Harper
Furio Honsell
Gordon Plotkin
1993
A Framework for Defining Logics
Journal of the ACM
40
1
143–184
10.1145/138027.138060
Paul Hudak
1996
Building Domain-Specific Embedded Languages
ACM Computing Surveys
28
4es
196
10.1145/242224.242477
J. Hughes
2000
Generalising monads to arrows
Science of Computer Programming
37
67–111
10.1016/S0167-6423(99)00023-4
John Hughes
1989
Why Functional Programming Matters
The Computer Journal
32
2
98–107
10.1093/comjnl/32.2.98
http://www.cse.chalmers.se/~rjmh/Papers/whyfp.html
Neil D. Jones
Carsten K. Gomard
Peter Sestoft
1993
Partial Evaluation and Automatic Program Generation
Prentice-Hall
Englewood Cliffs, NJ
Neil D. Jones
Flemming Nielson
1995
Abstract Interpretation: Semantics-Based Tool for Program Analysis
Samson Abramsky
Dov M. Gabbay
Tom S. E. Maibaum
Semantic Modelling
Handbook of Logic in Computer Science
4
Clarendon Press, Oxford , UK
527–636
Oleg Kiselyov
BER MetaOCaml Home page
http://okmij.org/ftp/ML/MetaOCaml.html
Oleg Kiselyov
2012
Typed Tagless Final Interpreters
Proceedings of the 2010 International Spring School Conference on Generic and Indexed Programming
SSGIP'10
Springer-Verlag
Berlin, Heidelberg
130–174
10.1007/978-3-642-32202-0_3
Oleg Kiselyov
Hiromi Ishii
2015
Freer monads, more extensible effects
Haskell
ACM
94–105
10.1145/2804302.2804319
Oleg Kiselyov
Amr Sabry
Cameron Swords
2013
Extensible effects: an alternative to monad transformers
Haskell
ACM
59–70
10.1145/2503778.2503791
Conor McBride
Ross Paterson
2008
Applicative Programming with Effects
J. Functional Programming
18
1
1–13
10.1017/S0956796800003658
Eugenio Moggi
Sonia Fagorzi
2003
A Monadic Multi-stage Metalanguage
Andrew D. Gordon
Proceedings of FoSSaCS 2003: Foundations of Software Science and Computational Structures, 6th International Conference
LNCS
2620
Springer
358–374
http://www.disi.unige.it/person/MoggiE/ftp/fossacs03.pdf
Sebastien Mondet
2017
Bioinformatics, The Typed Tagless Final Way
https://icfp17.sigplan.org/event/ocaml-2017-papers-bioinformatics-the-typed-tagless-final-way
P. J. Moylan
1992
The Case against C
Technical Report
TR–EE9240
Centre for Industrial Control Science, Department of Electrical and Computer Engineering
University of Newcastle, Australia
Frank Pfenning
Rowan Davies
2001
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
11
4
511–540
10.1017/S0960129501003322
George Pólya
1945
How to Solve It
Princeton University Press
Princeton, NJ
Michael O. Rabin
Dana Scott
1959
Finite Automata and Their Decision Problems
IBM Journal of Research and Development
3
114–125
10.1147/rd.32.0114
John C. Reynolds
1981
The Essence of Algol
Jacobus Willem de Bakker
J. C. van Vliet
Algorithmic Languages
North-Holland
Amsterdam
345–372
Tiark Rompf
Martin Odersky
2012
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs
Commun. ACM
55
6
121–130
10.1145/2184319.2184345
Tiark Rompf
Arvind K. Sujeeth
HyoukJoong Lee
Kevin J. Brown
Hassan Chafi
Martin Odersky
Kunle Olukotun
2011
Building-Blocks for Performance Oriented DSLs
DSL
93–117
10.4204/EPTCS.66.5
Sam Staton
2013
Instances of Computational Effects: An Algebraic Perspective
LICS
IEEE Computer Society
519
10.1109/LICS.2013.58
Nikhil Swamy
Nataliya Guts
Daan Leijen
Michael Hicks
2011
Lightweight Monadic Programming in ML
ICFP'11
15–27
10.1145/2034773.2034778
William W. Tait
1967
Intensional Interpretations of Functionals of Finite Type I
Journal of Symbolic Logic
32
2
198–212
10.1007/BF01447860
Philip Wadler
1994
Monads and Composable Continuations
Lisp and Symbolic Computation
7
1
39–56
10.1007/BF01019944
Mitchell Wand
1982
Specifications, Models, and Implementations of Data Abstractions
Theoretical Computer Science
20
1
3–32
10.1016/0304-3975(82)90097-4
Leo White
Frédéric Bour
Jeremy Yallop
2014
Modular implicits
Oleg Kiselyov
Jacques Garrigue
ML/OCaml
EPTCS
198
22–63
10.4204/EPTCS.198.2
Martin Wirsing
1990
Algebraic specifications
J. van Leeuwen
Handbook of Theoretical Computer Science B
Elsevier
675–788