βη-complete models for System F

DOI10.1017/S0960129502003778zbMath1029.03004OpenAlexW1997012206MaRDI QIDQ4405696

Stefano Berardi, Chantal Berline

Publication date: 8 February 2004

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129502003778

zbMATH Keywords

system \(F\)Scott continuous maps\(\beta\eta\)-completenesspolymorphic maps

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Internal models of system F for decompilation ⋮ Effective λ-models versus recursively enumerable λ-theories ⋮ Building continuous webbed models for system F

This page was built for publication: βη-complete models for System F