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...

Abstracting extensible data types: or, rows by any other name

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

2019

Volltextzugriff (PDF)

The view from the left

Journal of functional programming, 2004-01, Vol.14 (1), p.69-111

2004

Volltextzugriff (PDF)

Types for Proofs and Programs: International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000. Selected Papers

1, 2002

Volltextzugriff (PDF)

Forward- or reverse-mode automatic differentiation: What's the difference?

Science of computer programming, 2024-01, Vol.231, p.103010, Article 103010

2024

Volltextzugriff (PDF)

A type- and scope-safe universe of syntaxes with binding: their semantics and proofs

Journal of functional programming, 2021-01, Vol.31, Article e22

2021

Volltextzugriff (PDF)

Pure Type Systems without Explicit Contexts

Electronic proceedings in theoretical computer science, 2010-09, Vol.34 (Proc. LFMTP 2010), p.53-67

2010

Volltextzugriff (PDF)

A type and scope safe universe of syntaxes with binding: their semantics and proofs

Proceedings of ACM on programming languages, 2018-09, Vol.2 (ICFP), p.1-30

2018

Volltextzugriff (PDF)

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Logical methods in computer science, 2011-01, Vol.7, Issue 1 (1)

2011

Volltextzugriff (PDF)

Structural Subtyping as Parametric Polymorphism

Proceedings of ACM on programming languages, 2023-10, Vol.7 (OOPSLA2), p.1093-1121, Article 260

2023

Volltextzugriff (PDF)

Notions of Bidirectional Computation and Entangled State Monads

Mathematics of Program Construction, 2015, Vol.9129, p.187-214

2015

Volltextzugriff (PDF)

The λμT-calculus

Annals of pure and applied logic, 2013-06, Vol.164 (6), p.676-701

2013

Volltextzugriff (PDF)

The λ μ T -calculus

Annals of pure and applied logic, 2013-06, Vol.164 (6), p.676-701

2013

Volltextzugriff (PDF)

Introduction to Bidirectional Transformations

Bidirectional Transformations, 2018, Vol.9715, p.1-28

2018

Volltextzugriff (PDF)

Inductive Families Need Not Store Their Indices

Lecture notes in computer science, 2004, p.115-129

2004

Volltextzugriff (PDF)

Types for proofs and programs: international workshop, TYPES 2000, Durham, UK, December 8-12 2000 : selected papers

2014

Volltextzugriff (PDF)

Pure type systems formalized

Typed Lambda Calculi and Applications, 2005, p.289-305

2005

Volltextzugriff (PDF)

Reflections on Monadic Lenses

A List of Successes That Can Change the World, 2016, Vol.9600, p.1-31

2016

Volltextzugriff (PDF)

A Few Constructions on Constructors

Lecture notes in computer science, 2006, p.186-200

2006

Volltextzugriff (PDF)

A Sequent Calculus for Type Theory

Computer Science Logic, 2006, p.441-455

2006

Volltextzugriff (PDF)

On principles of Least Change and Least Surprise for bidirectional transformations

Journal of object technology, 2017, Vol.16 (1), p.3

2017

Volltextzugriff (PDF)

Some Lambda Calculus and Type Theory Formalized

Journal of automated reasoning, 1999-11, Vol.23 (3), p.373

1999

Volltextzugriff (PDF)

Proviola: a tool for proof re-animation

Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, 2010, p.440-454