A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata

First Author: Aehlig K
Attributed to:  Abstract Measures of Low-Level Computational Complexity funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/11874683_7

Publication URI: http://dx.doi.org/10.1007/11874683_7

Type: Book Chapter

Book Title: Computer Science Logic (2006)

Page Reference: 104-118