A foundation for GADTs and inductive families: dependent polynomial functor approach

Συγγραφείς: Makoto Hamana, Marcelo Fiore

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.gunma-u.ac.jp/~hamana/Papers/dep.pdf.

Θεματικοί όροι: Categories and Subject Descriptors D.3.3 [Language Constructs and Features, Data types and Structures, F.3.3 [Logics and Meaning of Programs, Studies of Program Constructs—Type structure General Terms Theory, Languages Keywords Dependent types, categorical semantics

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.2629

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.2629
http://www.cs.gunma-u.ac.jp/~hamana/Papers/dep.pdf

A foundation for GADTs and inductive families: dependent polynomial functor approach

Συγγραφείς: Makoto Hamana, Marcelo Fiore

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cl.cam.ac.uk/~mpf23/papers/Types/gadtif.pdf.

Θεματικοί όροι: Categories and Subject Descriptors D.3.3 [Language Constructs and Features, Data types and Structures, F.3.3 [Logics and Meaning of Programs, Studies of Program Constructs—Type structure General Terms Theory, Languages Keywords Dependent types, categorical semantics

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.501.7299; http://www.cl.cam.ac.uk/~mpf23/papers/Types/gadtif.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.501.7299
http://www.cl.cam.ac.uk/~mpf23/papers/Types/gadtif.pdf

A bisimulation for type abstraction and recursion

Συγγραφείς: Eijiro Sumii, Benjamin C. Pierce

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://basics.sjtu.edu.cn/~yuehg/popl/a bisimulation for type abstraction and recursion (2005).pdf.

Θεματικοί όροι: Categories and Subject Descriptors D.3.3 [Programming Languages, Language Constructs and Features—abstract data types, F.3.3 [Logics and Mean- ings of Programs, Studies of Program Constructs—Type structure General Terms Theory, Languages Keywords Lambda-Calculus, Contextual Equivalence, Bisimulations, Logical Relations, Existential Types, Recursive Types

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.522.6406; http://basics.sjtu.edu.cn/~yuehg/popl/a bisimulation for type abstraction and recursion (2005).pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.522.6406
http://basics.sjtu.edu.cn/~yuehg/popl/a bisimulation for type abstraction and recursion (2005).pdf