A dependent dependency calculus
From MaRDI portal
Publication:6166797
DOI10.1007/978-3-030-99336-8_15zbMath1528.68078arXiv2201.11040OpenAlexW4226400279MaRDI QIDQ6166797
Harley III Eades, Pritam Choudhury, Stephanie Weirich
Publication date: 3 August 2023
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.11040
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Notions of computation and monads
- Graded modal dependent type theory
- Coeffects
- Dependent Information Flow Types
- On Irrelevance and Algorithmic Equality in Predicative Type Theory
- I Got Plenty o’ Nuttin’
- Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
- A lattice model of secure information flow
- Syntax and Semantics of Quantitative Type Theory
- Degrees of Relatedness
- Type-theory in color
- Bounded Linear Types in a Resource Semiring
- A Core Quantitative Coeffect Calculus
- Erasure and Polymorphism in Pure Type Systems
- The Implicit Calculus of Constructions as a Programming Language with Dependent Types
This page was built for publication: A dependent dependency calculus
