Benedikt Ahrens (2011):
Modules over relative monads for syntax and semantics.
ArXiv e-prints.
Benedikt Ahrens & Julianna Zsidó (2011):
Initial Semantics for higher-order typed syntax in Coq.
Journal of Formalized Reasoning 4(1),
pp. 25–69.
Thorsten Altenkirch & Bernhard Reus (1999):
Monadic Presentations of Lambda Terms Using Generalized Inductive Types.
In: CSL,
pp. 453–468.
B. Aydemir, A. Bohannon, M. Fairbairn, J. Foster, B. Pierce, P. Sewell, D. Vytiniotis, G. Washburn, S. Weirich & S. Zdancewic (2005):
Mechanized metatheory for the masses: The POPLmark Challenge.
In: Proceedings of the Eighteenth International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005).
Richard Bird & Ross Paterson (1999):
Generalised Folds for Nested Datatypes.
Formal Aspects of Computing 11(2),
pp. 200–222.
Richard S. Bird & Ross Paterson (1999):
De Bruijn Notation as a Nested Datatype.
Journal of Functional Programming 9(1),
pp. 77–91.
Marcelo Fiore, Gordon Plotkin & Daniele Turi (1999):
Abstract Syntax and Variable Binding.
In: LICS '99: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science.
IEEE Computer Society,
Washington, DC, USA,
pp. 193.
Marcelo P. Fiore (2008):
Second-Order and Dependently-Sorted Abstract Syntax.
In: LICS.
IEEE Computer Society,
pp. 57–68,
doi:10.1109/LICS.2008.38.
Marcelo P. Fiore & Chung-Kil Hur (2010):
Second-Order Equational Logic (Extended Abstract).
In: Anuj Dawar & Helmut Veith: CSL,
Lecture Notes in Computer Science 6247.
Springer,
pp. 320–335,
doi:10.1007/978-3-642-15205-4_26.
Marcelo P. Fiore & Ola Mahmoud (2010):
Second-Order Algebraic Theories - (Extended Abstract).
In: Petr Hlinený & Anton\'ın Kucera: MFCS,
Lecture Notes in Computer Science 6281.
Springer,
pp. 368–380,
doi:10.1007/978-3-642-15155-2_33.
Marcelo P. Fiore & Daniele Turi (2001):
Semantics of Name and Value Passing.
In: Logic in Computer Science,
pp. 93–104.
Neil Ghani, Tarmo Uustalu & Makoto Hamana (2006):
Explicit substitutions and higher-order syntax.
Higher-order and Symbolic Computation 19(2–3),
pp. 263–282.
André Hirschowitz & Marco Maggesi (2007):
Modules over Monads and Linearity.
In: Daniel Leivant & Ruy J. G. B. de Queiroz: WoLLIC,
Lecture Notes in Computer Science 4576.
Springer,
pp. 218–237,
doi:10.1007/978-3-540-73445-1_16.
André Hirschowitz & Marco Maggesi (2010):
Modules over monads and initial semantics.
Information and Computation 208(5),
pp. 545–564,
doi:10.1016/j.ic.2009.07.003.
Special Issue: 14th Workshop on Logic, Language, Information and Computation (WoLLIC 2007).
Martin Hyland & John Power (2007):
The category theoretic understanding of universal algebra: Lawvere theories and monads.
Electronic Notes in Theoretical Computer Science 172,
pp. 437–458,
doi:10.1016/j.entcs.2007.02.019.
Ralph Matthes & Tarmo Uustalu (2004):
Substitution in non-wellfounded syntax with variable binding.
Theor. Comput. Sci. 327(1-2),
pp. 155–174,
doi:10.1016/j.tcs.2004.07.025.
Julianna Zsidó (2005/06):
Le lambda calcul vu comme monade initiale.
Université de Nice – Laboratoire J. A. Dieudonné.
Mémoire de Recherche – master 2.
Julianna Zsidó (2010):
Typed Abstract Syntax.
University of Nice, France.
http://tel.archives-ouvertes.fr/tel-00535944/.
eptcs@eptcs.org