Second-order and dependently-sorted abstract syntax

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 57-68

  Fiore, Marcelo ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC IN COMPUTER SCIENCE; SECOND ORDERS;

ALGEBRA; ARSENIC COMPOUNDS; COMPUTER NETWORKS; COMPUTERS;

SYNTACTICS;

EID: 51549088216     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.38     Document Type: Conference Paper

References (23)

1. P. Aczel. A general Church-Rosser theorem. Typescript, 1978.
2. M. Barr and C. Wells. Category Theory for Computing Science. Centre de Recherches Mathématiques, third edition, 1999.
3. J. Cartmell. Generalised algebraic theories and contextual categories. Annals of Pure and Applied Logic, 32:209-243, 1986.
4. th International Conference on Principles and Practice of Declarative Programming (PPDP 2002), pages 26-37, 2002.
5. M. Fiore. Mathematical models of computational and combinatorial structures. In Foundations of Software Science and Computation Structures (FOSSACS 2005), volume 3441 of Lecture Notes in Computer Science, pages 25-46, 2005.
6. nd Mathematical Foundations of Programming Semantics Conference (MFPS XXII), DISI, University of Genova, 2006. (Available from http://www.cl.cam.ac.uk/̃mpf23/).
7. M. Fiore. A mathematical theory of substitution and its applications to syntax and semantics. Invited tutorial for the Workshop on Mathematical Theories of Abstraction, Substitution and Naming in Computer Science, International Centre for Mathematical Sciences (ICMS), 2007. (Available from http://www.cl.cam.ac.uk/̃mpf23/).
8. M. Fiore. Towards a mathematical theory of substitution. Invited talk for the Annual International Conference on Category Theory, Carvoeiro, Algarve (Portugal), 2007. (Available from http://www.cl.cam.ac.uk/̃mpf 23/).
9. M. Fiore and C.-K. Hur. Equational systems and free constructions. In International Colloquium on Automata, Language and Programming (ICALP 2007), volume 4596 of Lecture Notes in Computer Science, pages 607-619, 2007.
10. M. Fiore and C.-K. Hur. Term equational systems and logics. To appear in XXIV Conference on the Mathematical Foundations of Programming Semantics, 2008.
11. th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pages 193-202, 1999.
12. M. Gabbay and A. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
13. nd Asian Symposium on Programming Languages and Systems (APLAS 2004), volume 3202 of Lecture Notes in Computer Science, pages 348-363, 2005.
14. G. Janelidze and G. Kelly. A note on actions of a monoidal category. Theory and Applications of Categories, 9(4):61-91, 2001.
15. A. Kock. Strong functors and monoidal monads. Archiv der Mathematik, XIII: 113-120, 1972.
16. F. W. Lawvere. More on graphic toposes. Cah. de Top. et Geom. Diff., 32:5-10, 1991.
17. D. Lehmann and M. Smyth. Algebraic specification of data types: A synthetic approach. Math. Systems Theory, 14:97-139, 1981.
18. M. Makkai. First-order logic with dependent sorts, with applications to category theory. Preprint, 1997.
19. th International Conference on Principles and Practice of Declarative Programming (PPDP 2003), pages 184-194, 2003.
20. J. Otto. Complexity doctrines. PhD thesis, Department of Mathematics and Statistics, McGill University, 1995.
21. A. M. Pitts. Alpha-structural recursion and induction. Journal of the ACM, 53:459-506, 2006.
22. rd ACM SIG-PLAN workshop on Mechanized reasoning about languages with variable binding, pages 13-24, 2005.
23. P. Taylor. Practical Foundations of Mathematics, volume 59 of Cambridge studies in advanced mathematics. Cambridge University Press. 1999.