scientific article; zbMATH DE number 3611322

zbMath0394.03019MaRDI QIDQ4175259

Luis E. Sanchis

Publication date: 1977

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lambda CalculusData StructuresRecursively Enumerable SetComputable FunctionData Types As Lattices

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• The isomorphism theorem in compactly generated lattices
• Data Types as Lattices
• Galois Connexions
• Closure Operators and Galois Theory in Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: