UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 206

Sortiert nach

Foundations of Software Science and Computation Structures: 4th International Conference, FOSSACS 2001 Held As Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings

1, 2001

Link zum Volltext

Verfügbarkeit prüfen

Conway games, algebraically and coalgebraically

Logical methods in computer science, 2011-09, Vol.7, Issue 3

2011

Link zum Volltext

Verfügbarkeit prüfen

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning

Electronic proceedings in theoretical computer science, 2019-10, Vol.307 (Proc. LFMTP 2019), p.8-23

2019

Link zum Volltext

Verfügbarkeit prüfen

A framework for defining logics

Journal of the ACM, 1993-01, Vol.40 (1), p.143-184

1993

Link zum Volltext

Verfügbarkeit prüfen

LF+ in Coq for "fast and loose" reasoning

Journal of Formalized Reasoning, 2019-01, Vol.12 (1), p.11-51

2019

Link zum Volltext

Verfügbarkeit prüfen

You need to show that you are not a robot

New media & society, 2019-08, Vol.21 (8), p.1859-1876

2019

Link zum Volltext

Verfügbarkeit prüfen

Gluing together Proof Environments: Canonical extensions of LF Type Theories featuring Locks

Electronic proceedings in theoretical computer science, 2015-07, Vol.185 (Proc. LFMTP 2015), p.3-17

2015

Link zum Volltext

Verfügbarkeit prüfen

Social robots as cultural objects: The sixth dimension of dynamicity?

The Information society, 2018-05, Vol.34 (3), p.141-152

2018

Link zum Volltext

Verfügbarkeit prüfen

Plugging-in proof development environments using Locks in LF

Mathematical structures in computer science, 2018-10, Vol.28 (9), p.1578-1605

2018

Link zum Volltext

Verfügbarkeit prüfen

An open logical framework

Journal of logic and computation, 2016-02, Vol.26 (1), p.293-335

2016

Link zum Volltext

Verfügbarkeit prüfen

RPO, Second-order Contexts, and Lambda-calculus

Logical methods in computer science, 2009-08, Vol.5, Issue 3

2009

Link zum Volltext

Verfügbarkeit prüfen

LLFP : A Logical Framework for modeling External Evidence, Side Conditions, and Proof Irrelevance using Monads

Logical methods in computer science, 2017-02

2017

Link zum Volltext

Verfügbarkeit prüfen

Prelogical Relations

Information and computation, 2002-10, Vol.178 (1), p.23-43

Honsell, F

2002

Link zum Volltext

Verfügbarkeit prüfen

mathsf{LLF}_{\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads

Logical methods in computer science, 2017-07, Vol.13, Issue 3

2017

Link zum Volltext

Verfügbarkeit prüfen

Prelogical Relations

Information and computation, 2002-10, Vol.178 (1), p.23-43

2002

Link zum Volltext

Verfügbarkeit prüfen

Foundations of Software Science and Computation Structures: 4th International Conference, FOSSACS 2001, Held As Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001 : Proceedings

2001

Link zum Volltext

Verfügbarkeit prüfen

Foundations of software science and computation structures: 4th international conference, FOSSACS 2001, held as part of the Joint European Conferences on Theory and Practice of Software ETAPS 2001, Genova, Italy, April 2-6, 2001 : proceedings

2014

Link zum Volltext

Verfügbarkeit prüfen

A type assignment system for game semantics

Theoretical computer science, 2008-05, Vol.398 (1), p.150-169

2008

Link zum Volltext

Verfügbarkeit prüfen

On the completeness of order-theoretic models of the λ-calculus

Information and computation, 2009-05, Vol.207 (5), p.583-594

2009

Link zum Volltext

Verfügbarkeit prüfen

A category of compositional domain-models for separable Stone spaces

Theoretical computer science, 2003, Vol.290 (1), p.599-635

2003

Link zum Volltext

Verfügbarkeit prüfen

Equivalences and Congruences on Infinite Conway Games

RAIRO. Informatique théorique et applications, 2012-04, Vol.46 (2), p.231-259

2012

Link zum Volltext

Verfügbarkeit prüfen

A Coalgebraic Description of Web Interactions

Lecture notes in computer science, 2003, p.271-283

2003

Link zum Volltext

Verfügbarkeit prüfen

On the completeness of order-theoretic models of the λ-calculus: From Type Theory to Morphological Complexity

Information and computation, 2009, Vol.207 (5), p.583-594

2009

Link zum Volltext

Verfügbarkeit prüfen

Consistency of the theory of contexts

Journal of functional programming, 2006-05, Vol.16 (3), p.327-372

2006

Link zum Volltext

Verfügbarkeit prüfen

Implementing Cantor’s Paradise

Programming Languages and Systems, p.229-250

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 206

Suche als RSS-Feed

Aktive Filter

ThemaLambda Calculus

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(95)
Mit Volltextzugriff
(203)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Thema

Computer Science
(63)
Science & Technology
(57)
Technology
(51)
Computer Science, Theory & Methods
(40)
Mathematics
(23)
Exact Sciences And Technology
(20)
Applied Sciences
(16)
Computer Science; Control Theory; Systems
(16)
Logical Frameworks
(16)
Theoretical Computing
(15)
Logic
(14)
Computer Science, Software Engineering
(13)
Physical Sciences
(13)
Type Theory
(11)
Computation And Language
(10)
Congresses
(10)
Logic In Computer Science
(10)
Science & Technology - Other Topics
(10)
Theory Of Computation
(10)
Artificial Intelligence
(8)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Foundations of Software Science and Computation Structures: 4th International Conference, FOSSACS 2001 Held As Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings

Conway games, algebraically and coalgebraically

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning

A framework for defining logics

LF+ in Coq for "fast and loose" reasoning

You need to show that you are not a robot

Gluing together Proof Environments: Canonical extensions of LF Type Theories featuring Locks

Social robots as cultural objects: The sixth dimension of dynamicity?

Plugging-in proof development environments using Locks in LF

An open logical framework

RPO, Second-order Contexts, and Lambda-calculus

LLFP : A Logical Framework for modeling External Evidence, Side Conditions, and Proof Irrelevance using Monads

Prelogical Relations

mathsf{LLF}_{\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads

Prelogical Relations

Foundations of Software Science and Computation Structures: 4th International Conference, FOSSACS 2001, Held As Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001 : Proceedings

Foundations of software science and computation structures: 4th international conference, FOSSACS 2001, held as part of the Joint European Conferences on Theory and Practice of Software ETAPS 2001, Genova, Italy, April 2-6, 2001 : proceedings

A type assignment system for game semantics

On the completeness of order-theoretic models of the λ-calculus

A category of compositional domain-models for separable Stone spaces

Equivalences and Congruences on Infinite Conway Games

A Coalgebraic Description of Web Interactions

On the completeness of order-theoretic models of the λ-calculus: From Type Theory to Morphological Complexity

Consistency of the theory of contexts

Implementing Cantor’s Paradise

Aktive Filter

Suchergebnisse filtern