scientific article; zbMATH DE number 3611322

zbMATH Open0394.03019MaRDI QIDQ4175259FDOQ4175259

Authors: Luis E. Sanchis 

Publication date: 1977

Full work available at URL: https://eudml.org/doc/92060

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

zbMATH Keywords

Lambda CalculusData StructuresRecursively Enumerable SetComputable FunctionData Types As Lattices

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Galois Connexions
• Data Types as Lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Closure Operators and Galois Theory in Lattices
• Title not available (Why is that?)
• The isomorphism theorem in compactly generated lattices

Cited In (5)

• Closures on CPOs form complete lattices
• Property preserving abstractions for the verification of concurrent systems
• Functional specification and proof of correctness for time dependent behaviour of reactive systems
• Refinement of events in the development of real-time distributed systems
• A functional model for describing and reasoning about time behaviour of computing systems

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 Q4175259)