Unifiers as equivalences: proof-relevant unification of dependently typed data (Q2985776): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEGO / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Agda / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Coq / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MiniAgda / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2513071761 / rank | |||
Normal rank | |||
Latest revision as of 02:31, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unifiers as equivalences: proof-relevant unification of dependently typed data |
scientific article |
Statements
Unifiers as equivalences: proof-relevant unification of dependently typed data (English)
0 references
10 May 2017
0 references
Agda
0 references
dependent types
0 references
inductive families
0 references
type theory
0 references
unification
0 references
