UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 178

Sortiert nach

Programming Languages and Systems: 33rd European Symposium on Programming, ESOP 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I

Weirich, Stephanie

1, 2024

Volltextzugriff (PDF)

Programming Languages and Systems: 33rd European Symposium on Programming, ESOP 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II

Weirich, Stephanie

1, 2024

Volltextzugriff (PDF)

Reasoning about the garden of forking paths

Proceedings of ACM on programming languages, 2021-08, Vol.5 (ICFP), p.1-28

2021

Volltextzugriff (PDF)

Practical type inference for arbitrary-rank types

Journal of functional programming, 2007-01, Vol.17 (1), p.1-82

2007

Volltextzugriff (PDF)

Parametricity, type equality, and higher-order polymorphism

Journal of functional programming, 2010-03, Vol.20 (2), p.175-210

2010

Volltextzugriff (PDF)

Dependently-Typed Programming with Logical Equality Reflection

Proceedings of ACM on programming languages, 2023-08, Vol.7 (ICFP), p.649-685, Article 210

2023

Volltextzugriff (PDF)

Program adverbs and Tlön embeddings

Proceedings of ACM on programming languages, 2022-08, Vol.6 (ICFP), p.312-342

2022

Volltextzugriff (PDF)

Mechanized Metatheory for the Masses: The PoplMark Challenge

Lecture notes in computer science, 2005, p.50-65

2005

Volltextzugriff (PDF)

Step-Indexed Normalization for a Language with General Recursion

Electronic proceedings in theoretical computer science, 2012-02, Vol.76 (Proc. MSFP 2012), p.25-39

2012

Volltextzugriff (PDF)

Internalizing Indistinguishability with Dependent Types

Proceedings of ACM on programming languages, 2024-01, Vol.8 (POPL), p.1298-1325, Article 44

2024

Volltextzugriff (PDF)

A graded dependent type system with a usage-aware semantics

Proceedings of ACM on programming languages, 2021-01, Vol.5 (POPL), p.1-32

2021

Volltextzugriff (PDF)

Position paper: the science of deep specification

Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences, 2017-10, Vol.375 (2104), p.20160331-20160331

2017

Volltextzugriff (PDF)

Needle & Knot: Binder Boilerplate Tied Up

Programming Languages and Systems, p.419-445

Volltextzugriff (PDF)

Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems

Electronic proceedings in theoretical computer science, 2012-02, Vol.76 (Proc. MSFP 2012), p.112-162

2012

Volltextzugriff (PDF)

An existential crisis resolved: type inference for first-class existential types

Proceedings of ACM on programming languages, 2021-08, Vol.5 (ICFP), p.1-29

2021

Volltextzugriff (PDF)

Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs

Proceedings of ACM on programming languages, 2024-08, Vol.8 (ICFP), p.30-63, Article 237

2024

Volltextzugriff (PDF)

Termination Casts: A Flexible Approach to Termination with General Recursion

Electronic proceedings in theoretical computer science, 2010-12, Vol.43 (Proc. PAR 2010), p.76-93

2010

Volltextzugriff (PDF)

Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code

Journal of functional programming, 2021, Vol.31, Article e5

2021

Volltextzugriff (PDF)

A role for dependent types in Haskell

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

2019

Volltextzugriff (PDF)

Position paper: the science of deep specification

Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences, 2017-10, Vol.375 (2104), p.1-24