Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)

Authors:
Roberto M. Amadio;Pierre-Louis Curien
Affiliations:
-;-
Venue:
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)
Year:
2008

Citing 0
Cited 7

Parametric λ-theories

Theoretical Computer Science
Sequentiality and Piecewise-affinity in Segments of Real-PCF

Electronic Notes in Theoretical Computer Science (ENTCS)
On an open problem of Amadio and Curien: The finite antichain condition

Information and Computation
Weakly distributive domains

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Interpreting a finitary pi-calculus in differential interaction nets

Information and Computation
The Scott model of linear logic is the extensional collapse of its relational model

Theoretical Computer Science
Typed vs. Untyped Realizability

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. To do this the authors explain denotational and operational semantics and exploit the duality between them.