Semantical analysis of perpetual strategies in \(\lambda\)-calculus
type: Item
instance of: scholarly article
title: Semantical analysis of perpetual strategies in \(\lambda\)-calculus
zbMATH Open document ID: 0913.68132
DOI: 10.1016/S0304-3975(98)00140-6
author: Furio Honsell
author: Marina Lenisa
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1238992
zbMATH Keywords: semantics
zbMATH Keywords: lambda calculus
zbMATH Keywords: observational equivalences
zbMATH Keywords: reduction strategies
zbMATH Keywords: normal forms
MaRDI profile type: Publication
cites work: Full abstraction in the lazy lambda calculus
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: A filter lambda model and the completeness of type assignment
cites work: Q3674616
cites work: The ant-lion paradigm for strong normalization
cites work: Q3221961
cites work: Type theories, normal forms, and \(D_{\infty}\)-lambda-models
cites work: Q4018065
cites work: Q4260372
cites work: Q3024839
cites work: An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
cites work: Proving congruence of bisimulation in functional programming languages
cites work: Q3024911
cites work: Inductive types and type constraints in the second-order lambda calculus
cites work: Relational properties of domains
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus
cites work: Q4880706
cites work: Effective longest and infinite reduction paths in untyped λ-calculi
full work available at URL: s0304-3975(98)00140-6
OpenAlex ID: W2025717798
description: scientific article; zbMATH DE number 1238992