A weak HOAS approach to the POPLmark Challenge

A weak HOAS approach to the POPLmark Challenge

Capitalizing on previous encodings and formal developments about nominal calculi and type systems, we propose a weak Higher-Order Abstract Syntax formalization of the type language of pure System F

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic proceedings in theoretical computer science 2013-03, Vol.113 (Proc. LSFA 2012), p.109-124
Hauptverfasser: Ciaffaglione, Alberto, Scagnetto, Ivan
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Capitalizing on previous encodings and formal developments about nominal calculi and type systems, we propose a weak Higher-Order Abstract Syntax formalization of the type language of pure System F
ISSN:2075-2180
2075-2180
DOI:10.4204/EPTCS.113.11