Martin Berger & Laurence Tratt (2010):
Program Logics for Homogeneous Meta-programming.
In: Edmund M. Clarke & Andrei Voronkov: Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers,
Lecture Notes in Computer Science 6355.
Springer,
pp. 64–81,
doi:10.1007/978-3-642-17511-4_5.
Lars Bergstrom, Matthew Fluet, Matthew Le, John H. Reppy & Nora Sandler (2014):
Practical and effective higher-order optimizations.
In: Johan Jeuring & Manuel M. T. Chakravarty: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, Gothenburg, Sweden, September 1-3, 2014.
ACM,
pp. 81–93,
doi:10.1145/2628136.2628153.
Swarat Chaudhuri (2008):
Subcubic algorithms for recursive state machines.
In: George C. Necula & Philip Wadler: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008.
ACM,
pp. 159–169,
doi:10.1145/1328438.1328460.
Wontae Choi, Baris Aktemur, Kwangkeun Yi & Makoto Tatsuta (2011):
Static analysis of multi-staged programs via unstaging translation.
In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011,
pp. 81–92,
doi:10.1145/1926385.1926397.
T. J.W. Clarke, P. J.S. Gladstone, C. D. MacLean & A. C. Norman (1980):
SKIM - The S, K, I Reduction Machine.
In: Proceedings of the 1980 ACM Conference on LISP and Functional Programming,
LFP '80.
ACM,
New York, NY, USA,
pp. 128–135,
doi:10.1145/800087.802798.
Thomas Given-Wilson & Barry Jay (2011):
A combinatory account of internal structure.
J. Symb. Log. 76(3),
pp. 807–826,
doi:10.2178/jsl/1309952521.
Jim Grundy, Thomas F. Melham & John W. O'Leary (2006):
A reflective functional language for hardware design and theorem proving.
J. Funct. Program. 16(2),
pp. 157–196,
doi:10.1017/S0956796805005757.
J. Roger Hindley & Jonathan P. Seldin (2008):
Lambda-Calculus and Combinators: An Introduction,
2nd edition.
Cambridge University Press,
New York, NY, USA,
doi:10.1017/CBO9780511809835.
David Van Horn & Harry G. Mairson (2008):
Deciding kCFA is complete for EXPTIME.
In: James Hook & Peter Thiemann: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008.
ACM,
pp. 275–282,
doi:10.1145/1411204.1411243.
David Van Horn & Harry G. Mairson (2008):
Flow Analysis, Linearity, and PTIME.
In: María Alpuente & Germán Vidal: Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 16-18, 2008. Proceedings,
Lecture Notes in Computer Science 5079.
Springer,
pp. 255–269,
doi:10.1007/978-3-540-69166-2_17.
Barry Jay & Jose Vergara (2014):
Confusion in the Church-Turing Thesis.
CoRR abs/1410.7103.
Available at http://arxiv.org/abs/1410.7103.
C. Barry Jay & Jens Palsberg (2011):
Typed self-interpretation by pattern matching.
In: Manuel M. T. Chakravarty, Zhenjiang Hu & Olivier Danvy: Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, ICFP 2011, Tokyo, Japan, September 19-21, 2011.
ACM,
pp. 247–258,
doi:10.1145/2034773.2034808.
Neil D. Jones & Nils Andersen (2007):
Flow analysis of lazy higher-order functional programs.
Theor. Comput. Sci. 375(1-3),
pp. 120–136,
doi:10.1016/j.tcs.2006.12.030.
Martin Lester, Luke Ong & Max Schäfer (2013):
Information Flow Analysis for a Dynamically Typed Language with Staged Metaprogramming.
In: 2013 IEEE 26th Computer Security Foundations Symposium, New Orleans, LA, USA, June 26-28, 2013.
IEEE,
pp. 209–223,
doi:10.1109/CSF.2013.21.
Martin Mariusz Lester (2013):
Position paper: the science of boxing.
In: Prasad Naldurg & Nikhil Swamy: Proceedings of the 2013 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security, PLAS 2013, Seattle, WA, USA, June 20, 2013.
ACM,
pp. 83–88,
doi:10.1145/2465106.2465120.
Tom Melham, Raphael Cohn & Ian Childs (2013):
On the Semantics of ReFLect as a Basis for a Reflective Theorem Prover.
CoRR abs/1309.5742.
Available at http://arxiv.org/abs/1309.5742.
Jan Midtgaard (2012):
Control-flow analysis of functional programs.
ACM Comput. Surv. 44(3),
pp. 10,
doi:10.1145/2187671.2187672.
Flemming Nielson, Hanne Riis Nielson & Chris Hankin (1999):
Principles of program analysis.
Springer,
doi:10.1007/978-3-662-03811-6.
C.-H. Luke Ong & Steven J. Ramsay (2011):
Verifying higher-order functional programs with pattern-matching algebraic data types.
In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011,
pp. 587–598,
doi:10.1145/1926385.1926453.
Olin Shivers (1988):
Control-Flow Analysis in Scheme.
In: Richard L. Wexelblat: Proceedings of the ACM SIGPLAN'88 Conference on Programming Language Design and Implementation (PLDI), Atlanta, Georgia, USA, June 22-24, 1988.
ACM,
pp. 164–174,
doi:10.1145/53990.54007.
David A Turner (1979):
Another algorithm for bracket abstraction.
The Journal of Symbolic Logic 44(02),
pp. 267–270,
doi:10.2307/2273733.
David A Turner (1979):
A new implementation technique for applicative languages.
Software: Practice and Experience 9(1),
pp. 31–49,
doi:10.1002/spe.4380090105.
Dimitrios Vardoulakis & Olin Shivers (2011):
CFA2: a Context-Free Approach to Control-Flow Analysis.
Logical Methods in Computer Science 7(2),
doi:10.2168/LMCS-7(2:3)2011.
Mitchell Wand & Galen B. Williamson (2002):
A Modular, Extensible Proof Method for Small-Step Flow Analyses.
In: Daniel Le Métayer: Programming Languages and Systems, 11th European Symposium on Programming, ESOP 2002, held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002, Proceedings,
Lecture Notes in Computer Science 2305.
Springer,
pp. 213–227,
doi:10.1007/3-540-45927-8_16.
eptcs@eptcs.org