Proceedings of the 9th ACM SIGPLAN Workshop on Generic Programming 2013
DOI: 10.1145/2502488.2502491
|View full text |Cite
|
Sign up to set email alerts
|

Generic datatypes à la carte

Abstract: Formal reasoning in proof assistants, also known as mechanization, has high development costs. Building modular reusable components is a key issue in reducing these costs. A stumbling block for reuse is that inductive definitions and proofs are closed to extension. This is a manifestation of the expression problem that has been addressed by the Meta-Theoryà la Carte (MTC) framework in the context of programming language meta-theory. However, MTC's use of extensible Church-encodings is unsatisfactory.This paper… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 28 publications
0
7
0
Order By: Relevance
“…From the point of view of possible applications to semantics and verification in frameworks such as OTT [15], the relational style that can be supported seems to fit in well with SOS and in particular with component-based approaches, such as the one proposed by Churchill, Mosses, Sculthorpe and Torrini [4]. Our plans for future work include integrating our technique in MTC/3MT, and comparing this approach with the container-based one proposed by Keuchel and Schrijvers [11].…”
Section: Resultsmentioning
confidence: 69%
See 3 more Smart Citations
“…From the point of view of possible applications to semantics and verification in frameworks such as OTT [15], the relational style that can be supported seems to fit in well with SOS and in particular with component-based approaches, such as the one proposed by Churchill, Mosses, Sculthorpe and Torrini [4]. Our plans for future work include integrating our technique in MTC/3MT, and comparing this approach with the container-based one proposed by Keuchel and Schrijvers [11].…”
Section: Resultsmentioning
confidence: 69%
“…Motivated by the importance of modularity in program development, semantics and verification, we have discussed the use of MDTs, their semantic foundations and their impredicative encoding along the lines of existing work [7,11,16]. We have shown how impredicative MDT encodings based on Mendler algebras can be used to reason about inductively defined relations, in a way that is comparatively close to a more conventional style of reasoning based on closed datatypes, by providing a simpler notion of proof algebra, if less general, than the one proposed by Delaware et al [7].…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…She got in contact with a group of sages in the area of verification stating her problem concerning Coq's restriction. These experts pointed her to a manuscript by Keuchel et al [16]. Keuchel and Schrijvers wanted to define the following data type in Coq that can be used to define the fix point of a functor.…”
Section: Free Monadsmentioning
confidence: 99%