Author:
Benton Nick,Kennedy Andrew,Varming Carsten
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lecture Notes in Computer Science;R. Adams,2006
2. Lecture Notes in Computer Science;S. Agerholm,1994
3. Agerholm, S.: Formalizing a model of the lambda calculus in HOL-ST. Technical Report 354, University of Cambridge Computer Laboratory (1994)
4. Agerholm, S.: LCF examples in HOL. The Computer Journal 38(2) (1995)
5. Lecture Notes in Computer Science;T. Altenkirch,1999
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Apartness, sharp elements, and the Scott topology of domains;Mathematical Structures in Computer Science;2023-08
2. Formalized High Level Synthesis with Applications to Cryptographic Hardware;Lecture Notes in Computer Science;2023
3. A Temporal Requirements Language for Deductive Verification of Process-Oriented Programs;2022 IEEE 23rd International Conference of Young Professionals in Electron Devices and Materials (EDM);2022-06-30
4. Inductive and Coinductive Predicate Liftings for Effectful Programs;Electronic Proceedings in Theoretical Computer Science;2021-12-29
5. Two Guarded Recursive Powerdomains for Applicative Simulation;Electronic Proceedings in Theoretical Computer Science;2021-12-29