Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS 2018)

& (eds.)
Deerfield Beach, FL, USA: (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Chapters

Dialectica Categories for the Lambek Calculus.Valeria Correa Vaz De Paiva & Harley Eades Iii

Similar books and articles

Logical Foundations of Computer Science: Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings.Anil Nerode & YuV Matiyasevich - 1994 - Springer.
Dialectica Categories for the Lambek Calculus.Valeria Correa Vaz De Paiva & Harley Eades Iii - 2018 - In Valeria Correa Vaz De Paiva & Harley Eades Iii (eds.), Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS 2018). Deerfield Beach, FL, USA:
Logic at Botik '89: Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989, Proceedings.Albert R. Meyer & Michael A. Taitslin - 1989 - Springer Verlag.
Logical Foundations of Computer Science Tver '92 : Second International Symposium, Tver, Russia, July, 20-24, 1992 : Proceedings.Anil Nerode & M. A. Taitslin - 1992
Mathematical Foundations of Computer Science 1991 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991 : Proceedings.Andrzej Tarlecki & International Symposium on Mathematical Foundations of Computer Science - 1991
Mathematical Foundations of Computer Science 1990 Banská Bystrica, Czechoslovakia, August 27-31, 1990 : Proceedings.B. Rovan & Symposium on Mathematical Foundations of Computer Science - 1990
Logical Foundations of Computer Science: 4th International Symposium, Lfcs'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings.Sergei Adian - 1997 - Springer Verlag.
Algorithms for quantum computation: Discrete logarithms and factoring.P. Shor - 1994 - Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science:124-134.
A. Bertoni. Mathematical methods of the theory of stochastic automata. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 9–22. - R. V. Freivald. Functions computable in the limit by probabilistic machines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 77–87. - B. Goetze and R. Klette. Some properties of limit recursive functions. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 88–90. - Ole-Johan Dahl. An approach to correctness proofs of semicoroutines. [REVIEW]Steven S. Muchnick - 1977 - Journal of Symbolic Logic 42 (3):422-423.
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 , pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springe. [REVIEW]Robert Goldblatt - 1986 - Journal of Symbolic Logic 51 (1):225-227.
Proceedings Symposium on Logic in Computer Science, Ithaca, New York, June 22-25, 1987 ; Sponsored by the Computer Society of the Ieee Technical Committee on Mathematical Foundations of Computing in Cooperation with Acm Sigact, Association for Symbolic Logic, European Association for Theoretical Computer Science.Association for Computing Machinery, Association for Symbolic Logic, European Association for Theoretical Computer Science, Ieee Computer Society & Special Interest Group for Automata and Computability Theory - 1987
Computer Science Logic: 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings.Jerzy Marcinkowski, Andrzej Tarlecki & European Association for Computer Science Logic - 2004 - Springer Verlag.
Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734).Sergei Artemov & Anil Nerode (eds.) - 2013 - Springer.
Algorithm theory - SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014: proceedings.R. Ravi & Inge Li Gørtz (eds.) - 2014 - New York: Springer.
The Deductive Foundations of Computer Programming: A One-volume Version of The Logical Basis for Computer Programming.Zohar Manna & Richard Waldinger - 1993 - Addison-Wesley Professional.

Analytics

Added to PP
2024-05-04

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references