Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Fully Complete Minimal PER Mod...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Fully Complete Minimal PER Models for the Simply Typed λ−calculus
Bibliographic Details
Main Authors:
Abramsky, S
,
Lenisa, M
Format:
Conference item
Published:
2001
Holdings
Description
Similar Items
Staff View
Similar Items
A Fully Complete PER Model for ML Polymorphic Types
by: Abramsky, S, et al.
Published: (2000)
Axiomatizing Fully Complete Models for ML Polymorphic Types
by: Abramsky, S, et al.
Published: (2000)
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
by: Naokata Shikuma, et al.
Published: (2008-09-01)
The Lazy λ−Calculus
by: Abramsky, S
Published: (1990)
Full Abstraction in the Lazy λ−calculus
by: Abramsky, S, et al.
Published: (1993)