Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3646849

From MaRDI portal
Publication:3205213
Jump to:navigation, search

zbMATH Open0416.03017MaRDI QIDQ3205213FDOQ3205213


Authors:


Publication date: 1978



Title of this publication is not available (Why is that?)




zbMATH Keywords

lambda calculussemantic treesymbolic evaluation of lambda expressionssyntactic model


Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)



Cited In (14)

  • Sequential evaluation strategies for parallel-or and related reduction systems
  • Sequential algorithms on concrete data structures
  • An algebraic approach to stable domains
  • The chemical abstract machine
  • Combinatory reduction systems: Introduction and survey
  • Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
  • A complete characterization of primitive recursive intensional behaviours
  • A stable programming language
  • Distributive semantics for nondeterministic typed \(\lambda\)-calculi
  • Expressive power of typed and type-free programming languages
  • Stability, sequentiality and demand driven evaluation in dataflow
  • Full abstraction and the Context Lemma (preliminary report)
  • Needed reduction and spine strategies for the lambda calculus
  • Descendants and origins in term rewriting.





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3205213)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3205213&oldid=16328272"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki