A Short Note on Collecting Dependently Typed Values

08/28/2018
by   Jan de Muijnck-Hughes, et al.
0

Within dependently typed languages, such as Idris, types can depend on values. This dependency, however, can limit the collection of items in standard containers: all elements must have the same type, and as such their types must contain the same values. We present two dependently typed data structures for collecting dependent types: DList and PList. Use of these new data structures allow for the creation of single succinct inductive ADT whose constructions were previously verbose and split across many data structures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2020

Adaptive Fibonacci and Pairing Heaps

This brief note presents two adaptive heap data structures and conjectur...
research
07/11/2014

Decision-Making with Complex Data Structures using Probabilistic Programming

Existing decision-theoretic reasoning frameworks such as decision networ...
research
02/04/2022

Generative Modeling of Complex Data

In recent years, several models have improved the capacity to generate s...
research
08/12/2021

Ethereum Data Structures

Ethereum platform operates with rich spectrum of data structures and has...
research
03/22/2022

How Interest-Driven Content Creation Shapes Opportunities for Informal Learning in Scratch: A Case Study on Novices' Use of Data Structures

Through a mixed-method analysis of data from Scratch, we examine how nov...
research
12/14/2018

Truly Visual Polymorphic Algebraic Data Structures through Maramafication

This paper presents a so-called maramafication of an essential part of f...
research
02/26/2023

Data Structures for Deviation Payoffs

We present new data structures for representing symmetric normal-form ga...

Please sign up or login with your details

Forgot password? Click here to reset