Fully Generic Programming Over Closed Universes of Inductive-Recursive Types

doi 10.15760/etd.3426
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Portland State University Library

Related search

Generic Generic Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Cubical Agda: A Dependently Typed Programming Language With Univalence and Higher Inductive Types

Proceedings of the ACM on Programming Languages
2019English

Accelerated Closed Universes in Scalar–tensor Theories

Classical and Quantum Gravity
AstronomyPhysics
2003English

Staged Generic Programming

Proceedings of the ACM on Programming Languages
2017English

Constructing Inductive-Inductive Types in Cubical Type Theory

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

A History of Probabilistic Inductive Logic Programming

Frontiers Robotics AI
Computer Science ApplicationsArtificial Intelligence
2014English

Inductive, Coinductive, and Pointed Types

ACM SIGPLAN Notices
1996English

Recursive Equivalence Types and Octahedra

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1983English

Representing Biases for Inductive Logic Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy