Redundancy Elimination for LF (Q2871840)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Redundancy Elimination for LF	scientific article

Statements

scholarly article

0 references

Redundancy Elimination for LF (English)

0 references

0 references

Electronic Notes in Theoretical Computer Science

0 references

publication date

10 January 2014

0 references

zbMATH Keywords

proof compression

0 references

dependent type theory

0 references

bidirectional type checking

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.entcs.2007.11.014

0 references

A framework for defining logics

0 references

On equivalence and canonical forms in the LF type theory

0 references

0 references

A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification

0 references

0 references

0 references

Structural cut elimination. I: Intuitionistic and classical logic

0 references

0 references

Types for Proofs and Programs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.ENTCS.2007.11.014

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2871840

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2871840&oldid=39229498"