(2012): Volumes 7200–7249 - Index of files in - University of Utah

REFERENCES 118
ISSN 0302-9743 (print), 1611-3349 (electronic). URL http://link.
springer.com/chapter/10.1007/978-3-642-29485-3_8/.
Kreitz:2012:NLF
[567] Christoph Kreitz. Nuprl as logical framework for automating proofs
in category theory. Lecture Notes in Computer Science, 7230:124–148,
2012. CODEN LNCSD9. ISSN 0302-9743 (print), 1611-3349 (electronic).
URL http://link.springer.com/chapter/10.1007/978-3-
642-29485-3_9/.
Kupke:2012:FCA
[568] Clemens Kupke and Jan J. M. M. Rutten. On the final coalgebra of
automatic sequences. Lecture Notes in Computer Science, 7230:149–
164, 2012. CODEN LNCSD9. ISSN 0302-9743 (print), 1611-3349
(electronic). URL http://link.springer.com/chapter/10.1007/978-
3-642-29485-3_10/.
Michalewski:2012:TCR
[569] Henryk Michalewski and Damian Niwiński. On topological completeness
of regular tree languages. Lecture Notes in Computer Science, 7230:
165–179, 2012. CODEN LNCSD9. ISSN 0302-9743 (print), 1611-3349
(electronic). URL http://link.springer.com/chapter/10.1007/978-
3-642-29485-3_11/.
Moss:2012:CLS
[570] Lawrence S. Moss, Erik Wennstrom, and Glen T. Whitney. A complete
logical system for the equality of recursive terms for sets. Lecture Notes
in Computer Science, 7230:180–203, 2012. CODEN LNCSD9. ISSN 0302-
9743 (print), 1611-3349 (electronic). URL http://link.springer.com/
chapter/10.1007/978-3-642-29485-3_12/.
Palsberg:2012:ONC
[571] Jens Palsberg. Overloading is NP-Complete. Lecture Notes in Computer
Science, 7230:204–218, 2012. CODEN LNCSD9. ISSN 0302-9743 (print),
1611-3349 (electronic). URL http://link.springer.com/chapter/10.
1007/978-3-642-29485-3_13/.
Knight:2012:CEL
[572] Sophia Knight, Radu Mardare, and Prakash Panangaden. Combining
epistemic logic and Hennessy–Milner logic. Lecture Notes in Computer
Science, 7230:219–243, 2012. CODEN LNCSD9. ISSN 0302-9743 (print),
1611-3349 (electronic). URL http://link.springer.com/chapter/10.
1007/978-3-642-29485-3_14/.