Zobrazeno 1 - 3
of 3
pro vyhledávání: '"PientkaBrigitte"'
Publikováno v:
ACM SIGPLAN Notices. 51:351-363
Indexed data types allow us to specify and verify many interesting invariants about finite data in a general purpose programming language. In this paper we investigate the dual idea: indexed codata types, which allow us to describe data-dependencies
Autor:
M AbelAndreas, PientkaBrigitte
Publikováno v:
ACM SIGPLAN Notices. 48:185-196
In this paper, we study strong normalization of a core language based on System F-omega which supports programming with finite and infinite structures. Building on our prior work, finite data such as finite lists and trees are defined via constructor
Autor:
PientkaBrigitte
Publikováno v:
ACM SIGPLAN Notices. 43:371-382
Higher-order abstract syntax (HOAS) is a simple, powerful technique for implementing object languages, since it directly supports common and tricky routines dealing with variables, such as capture-avoiding substitution and renaming. This is achieved