Behavioural correctness of data representations
Science of Computer Programming
Correctness of data representations in Algol-like languages
A classical mind
Foundations of programming languages
Foundations of programming languages
Information and Computation
The Craft of Programming
An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Logical Relations and Inductive/Coinductive Types
Proceedings of the 12th International Workshop on Computer Science Logic
Second-Order Logical Relations (Extended Abstract)
Proceedings of the Conference on Logic of Programs
Lazy Functional Algorithms for Exact Real Functionals
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
A Higher-Order Simulation Relation for System F
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Global Development via Local Observational Construction Steps
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of refinement is presented.