Explicit substitutions and higher-order syntax

Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003

Volumn , Issue , 2003, Pages

  Ghani, Neil ^a   Uustalu, Tarmo ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

Abstract syntax; Algebras; Explicit substitutions; Monads; Variable binding

Indexed keywords

ALGEBRA; CALCULATIONS; DIFFERENTIATION (CALCULUS); SEMANTICS; SYNTACTICS;

ABSTRACT SYNTAX; ARBITRARY NUMBER; EXPLICIT SUBSTITUTIONS; FIRST-ORDER LANGUAGE; FUNCTOR CATEGORY; MONADS; UNTYPED LAMBDA CALCULUS; VARIABLE BINDING;

BINS;

EID: 84969348616     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/976571.976580     Document Type: Conference Paper

References (21)

1. P. Aczel, J. Adámek, S. Milius, and J. Velebil. Infinite trees and completely iterative theories: A coalgebraic view. Theor. Comp. Sci., 300W (1-3):1-45, 2003.
2. J. Adámek, S. Milius, and J. Velebil. Free iterative theories: A coalgebraic view. Math. Struct. in Comp. Sci., 13(2):259-320, 2003.
3. J. Adámek, S. Milius, and J. Velebil. On rational monads and free iterative theories. In R. Blute and P. Selinger, eds., Proc. of 9th Conf. on Category Theory and Comp. Sci., CTCS'02, v. 69 of Electr. Notes in Theor. Comp. Sci. Elsevier, 2003.
4. J. Adámek and J. Rosický. Locally Presentable and Accessible Categories, v. 189 of London Math. Soc. Lecture Note Series. Cambridge Univ. Press, 1994.
5. T. Altenkirch and B. Reus. Monadic presentations of lambda terms using generalized inductive types. In J. Flum and M. Rodríguez-Artalejo, eds., Proc. of 13th Int. Wksh. on Comp. Sci. Logic, CSL'99, v. 1683 of Lect. Notes in Comp. Sci., pp. 453-468. Springer-Verlag, 1999.
6. E. J. Dubuc and G. M. Kelly. A presentation of topoi as algebraic relative to categories or graphs. J. of Algebra, 83:420-433, 1983.
7. M. Fiore. Semantic analysis of normalisation by evaluation for typed lambda calculus. In Proc. of 4th Int. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming, PPDP'02, pp. 26-37. ACM Press, 2002.
8. M. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding (extended abstract). In Proc. of 14th Ann. IEEE Symp. on Logic in Comp. Sci., LICS'99, pp. 193-202. IEEE CS Press, 1999.
9. M. Fiore and D. Turi. Semantics of name and value passing. In Proc. of 16th Ann. IEEE Symp. on Logic in Comp. Sci., LICS'01, pp. 93-104. IEEE CS Press, 2001.
10. N. Ghani, C. Lüth, and F. De Marchi. Coalgebraic monads. In L. S. Moss, ed., Proc. of 5th Wksh. on Coalgebraic Methods in Comp. Sci., CMCS'02, v. 65 (1) of Electr. Notes in Theor. Comp. Sci. EElsevier, 2002.
11. N. Ghani, C. Lüth, F. De Marchi, and J. Power. Dualising initial algebras. Math. Struct. in Comp. Sci., 13(2):349-370, 2003.
12. M. Hofmann. Semantical analysis of higher-order abstract syntax. In Proc. of 14th Ann. IEEE Symp. on Logic in Comp. Sci., LICS'99, pp. 204-213. IEEE CS Press, 1999.
13. M. Hyland, G. Plotkin, and J. Power. Combining computational effects: Commutativity and sum. In A. Baeza-Yates, U. Montanari, and N. Santoro, eds., Proc. of IFIP 17th World Computer Congress, TC1 Stream/2nd IFIP Int. Conf. on Theor. Comp. Sci., TCS 2002, v. 223 of IFIP Conf. Proc., pp. 474-484. Kluwer Acad. Publishers, 2002.
14. C. Lüth and N. Ghani. Monads and modular term rewriting. In E. Moggi and G. Rosolini, eds., Proc. of 7th Int. Conf. on Category Theory and Comp. Sci., CTCS'97, v. 1290 of Lect. Notes in Comp. Sci., pp. 69-86. Springer-Verlag, 1997.
15. C. Lüth and N. Ghani. Composing monads using coproducts. In Proc. of 7th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'02, v. 37 (9) of SIGPLAN Notices, pp. 133-144. ACM Press, New York, 2002.
16. C. Lüth and N. Ghani. Monads and modularity. In A. Armando, ed., Proc. of 4th Int. Wksh. on Frontiers of Combining Systems, FroCoS 2002, v. 2309 of Lect. Notes in Artif. Intell., pp. 18-32. Springer-Verlag, 2002.
17. S. Mac Lane. Categories for the Working Mathematician, v. 5 of Graduate Texts in Math. Springer-Verlag, 2nd ed., 1997. (1st ed., 1971).
18. R. Matthes and T. Uustalu. Substitution in non-wellfounded syntax with variable binding. In H. P. Gumm, ed., Proc. of 6th Int. Wksh. on Coalg. Methods in Comp. Sci., CMCS'03, v. 82 (4) of Electr. Notes in Theor. Comp. Sci. Elsevier, 2003.
19. M. Miculan and I. Scagnetto. A framework for typed HOAS and semantics. To appear in Proc. of PPDP'03, ACM Press, 2003.
20. S. Milius. On iteratable endofunctors. In R. Blute and P. Selinger, eds., Proc. of 9th Conf. on Category Theory and Comp. Sci., CTCS'02, v. 69 of Electr. Notes in Theor. Comp. Sci. Elsevier, 2003.
21. L. S. Moss. Parametric corecursion. Theor. Comp. Sci., 260(1-2):139-163, 2001.