UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Rusty Variation: Deadlock-free Sessions with Failure in Rust

Electronic proceedings in theoretical computer science, 2019-09, Vol.304 (Proc. ICE 2019), p.48-60

Kokke, Wen

2019

Volltextzugriff (PDF)

Prioritise the Best Variation

Logical methods in computer science, 2023-01, Vol.19, Issue 4

2023

Volltextzugriff (PDF)

Separating Sessions Smoothly

Logical methods in computer science, 2023-01, Vol.19, Issue 3

2023

Volltextzugriff (PDF)

Taking Linear Logic Apart

Electronic proceedings in theoretical computer science, 2019, Vol.292 (Proc. Linearity-TLLA 2018), p.90-103

2019

Volltextzugriff (PDF)

Towards Races in Linear Logic

Logical methods in computer science, 2020-01, Vol.16, Issue 4

2020

Volltextzugriff (PDF)

Prioritise the Best Variation

Formal Techniques for Distributed Objects, Components, and Systems, p.100-119

Volltextzugriff (PDF)

Programming language foundations in Agda

Science of computer programming, 2020-08, Vol.194, p.102440, Article 102440

2020

Volltextzugriff (PDF)

Better late than never: a fully-abstract semantics for classical processes

Proceedings of ACM on programming languages, 2019-01, Vol.3 (POPL), p.1-29

2019

Volltextzugriff (PDF)

Towards Races in Linear Logic

Coordination Models and Languages, p.37-53

Volltextzugriff (PDF)

Neural Networks, Secure by Construction: An Exploration of Refinement Types

Programming Languages and Systems, p.67-85

Volltextzugriff (PDF)

Featherweight go

Proceedings of ACM on programming languages, 2020-11, Vol.4 (OOPSLA), p.1-29, Article 149

2020

Volltextzugriff (PDF)

Auto in Agda: Programming Proof Search Using Reflection

Mathematics of Program Construction, 2015, p.276-301

2015

Volltextzugriff (PDF)

Deadlock-free session types in linear Haskell

Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell, 2021, p.1-13

2021

Volltextzugriff (PDF)

Continuous Verification of Machine Learning: a Declarative Programming Approach

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming, 2020, p.1-3

2020

Volltextzugriff (PDF)

Strong and Weak Quantifiers in Focused NLCL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_{\text {CL}}$$\end{document}

Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016), 2016, p.134-148

2016

Volltextzugriff (PDF)

1 – 15 von 15

Menü

Weitere Dienste

Einstellungen

Rusty Variation: Deadlock-free Sessions with Failure in Rust

Prioritise the Best Variation

Separating Sessions Smoothly

Taking Linear Logic Apart

Towards Races in Linear Logic

Prioritise the Best Variation

Programming language foundations in Agda

Better late than never: a fully-abstract semantics for classical processes

Towards Races in Linear Logic

Neural Networks, Secure by Construction: An Exploration of Refinement Types

Featherweight go

Auto in Agda: Programming Proof Search Using Reflection

Deadlock-free session types in linear Haskell

Continuous Verification of Machine Learning: a Declarative Programming Approach

Suchergebnisse filtern