×

Found 10 Documents (Results 1–10)

The clocks they are adjunctions. Denotational semantics for clocked type theory. (English) Zbl 1462.68023

Kirchner, Hélène (ed.), 3rd international conference on formal structures for computation and deduction, FSCD 2018, July 9–12, 2018, Oxford, United Kingdom. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 108, Article 23, 17 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A model of guarded recursion with clock synchronisation. (English) Zbl 1351.68057

Ghica, Dan (ed.), Proceedings of the 31st conference on the mathematical foundations of programming semantics (MFPS XXXI), Nijmegen, The Netherlands, June 22–25, 2015. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 319, 83-101, electronic only (2015).
MSC:  68N18 03B15 03B70 18C50 68N30 68Q55
PDFBibTeX XMLCite
Full Text: DOI

Linearly-used state in models of call-by-value. (English) Zbl 1344.68040

Corradini, Andrea (ed.) et al., Algebra and coalgebra in computer science. 4th international conference, CALCO 2011, Winchester, UK, August 30 – September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22943-5/pbk). Lecture Notes in Computer Science 6859, 298-313 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Enriching an effect calculus with linear types. (English) Zbl 1257.03053

Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 240-254 (2009).
MSC:  03B70 03F52 18C50
PDFBibTeX XMLCite
Full Text: DOI Link

Synthetic domain theory and models of linear Abadi & Plotkin logic. (English) Zbl 1273.03108

Escardó, M. (ed.) et al., Proceedings of the 21st annual conference on mathematical foundations of programming semantics (MFPS XXI), University of Birmingham, Birmingham, UK, May 18–21, 2005. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 155, 219-245 (2006).
PDFBibTeX XMLCite
Full Text: Link

Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus. (English) Zbl 1273.03099

Escardó, M. (ed.) et al., Proceedings of the 21st annual conference on mathematical foundations of programming semantics (MFPS XXI), University of Birmingham, Birmingham, UK, May 18–21, 2005. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 155, 191-217 (2006).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software