scientific article; zbMATH DE number 3611322

MaRDI QIDQ4175259zbMATH OpenFDO

Authors Luis E. Sanchis

Publication date 1977

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

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

• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 3490449 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Closure Operators and Galois Theory in Lattices
• Data Types as Lattices
• Galois Connexions
• 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)