Article

Some Domain Theory and Denotational Semantics in Coq

Authors:

Andrew Kennedy,

Carsten VarmingAuthors Info & Claims

TPHOLs '09: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics

Pages 115 - 130

https://doi.org/10.1007/978-3-642-03359-9_10

Published: 20 August 2009 Publication History

Abstract

We present a Coq formalization of constructive <em>***</em> -cpos (extending earlier work by Paulin-Mohring) up to and including the inverse-limit construction of solutions to mixed-variance recursive domain equations, and the existence of invariant relations on those solutions. We then define operational and denotational semantics for both a simply-typed CBV language with recursion and an untyped CBV language, and establish soundness and adequacy results in each case.

References

[1]

Adams, R.: Formalized metatheory with terms represented by an indexed family of types. In: Filliâtre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol. 3839, pp. 1-16. Springer, Heidelberg (2006).

[2]

Agerholm, S.: Domain theory in HOL. In: Joyce, J.J., Seger, C.-J.H. (eds.) HUG 1993. LNCS, vol. 780. Springer, Heidelberg (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]

Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 453-468. Springer, Heidelberg (1999).

[6]

Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 49-68. Springer, Heidelberg (2006).

[7]

Bartels, F., Dold, A., Pfeifer, H., Von Henke, F.W., Rueß, H.: Formalizing fixed-point theory in PVS. Technical report, Universität Ulm (1996).

[8]

Benton, N., Hur, C.-K.: Biorthogonality, step-indexing and compiler correctness. In: ACM International Conference on Functional Programming (2009).

[9]

Capretta, V.: General recursion via coinductive types. Logical Methods in Computer Science 1 (2005).

[10]

Coquand, T.: Infinite objects in type theory. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993, vol. 806. Springer, Heidelberg (1994).

[11]

Freyd, P.: Recursive types reduced to inductive types. In: IEEE Symposium on Logic in Computer Science (1990).

[12]

Freyd, P.: Remarks on algebraically compact categories. In: Applications of Categories in Computer Science. LMS Lecture Notes, vol. 177 (1992).

[13]

Joyal, A., Street, R.: The geometry of tensor calculus. Adv. in Math. 88 (1991).

[14]

Kahn, G.: Elements of domain theory. In: The Coq users' contributions library (1993).

[15]

McBride, C.: Type-preserving renaming and substitution (unpublished draft).

[16]

Milner, R.: Logic for computable functions: Description of a machine implementation. Technical Report STAN-CS-72-288, Stanford University (1972).

[17]

Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55-92 (1991).

[18]

Müller, O., Nipkow, T., von Oheimb, D., Slotosch, O.: HOLCF = HOL + LCF. J. Functional Programming 9 (1999).

[19]

Nipkow, T.: Winskel is (almost) right: Towards a mechanized semantics textbook. Formal Aspects of Computing 10 (1998).

[20]

Paulin-Mohring, C.: A constructive denotational semantics for Kahn networks in Coq. In: From Semantics to Computer Science. Essays in Honour of G Kahn (2009).

[21]

Petersen, K.D.: Graph model of LAMBDA in higher order logic. In: Joyce, J.J., Seger, C.-J.H. (eds.) HUG 1993. LNCS, vol. 780. Springer, Heidelberg (1994).

[22]

Pitts, A.M.: Computational adequacy via 'mixed' inductive definitions. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol. 802. Springer, Heidelberg (1994).

[23]

Pitts, A.M.: Relational properties of domains. Inf. Comput. 127 (1996).

[24]

Regensburger, F.: HOLCF: Higher order logic of computable functions. In: Schubert, E.T., Alves-Foss, J., Windley, P. (eds.) HUG 1995. LNCS, vol. 971. Springer, Heidelberg (1995).

[25]

Reus, B.: Formalizing a variant of synthetic domain theory. J. Automated Reasoning 23 (1999).

[26]

Varming, C., Birkedal, L.: Higher-order separation logic in Isabelle/HOLCF. In: Mathematical Foundations of Programming Semantics (2008).

Cited By

Harrison WBlumenfeld IBond EHathhorn CLi PTorrence MZiegler J(2023)Formalized High Level Synthesis with Applications to Cryptographic HardwareNASA Formal Methods10.1007/978-3-031-33170-1_20(332-352)Online publication date: 16-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-33170-1_20
Kaarsgaard RVeltri N(2019)En Garde! Unguarded Iteration for Reversible Computation in the Delay MonadMathematics of Program Construction10.1007/978-3-030-33636-3_13(366-384)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-33636-3_13
Pardo AGunther EPagano MViera MSabel DThiemann P(2018)An Internalist Approach to Correct-by-Construction CompilersProceedings of the 20th International Symposium on Principles and Practice of Declarative Programming10.1145/3236950.3236965(1-12)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1145/3236950.3236965
Show More Cited By

Some Domain Theory and Denotational Semantics in Coq
1. Mathematics of computing
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Call-by-push-value in Coq: operational, equational, and denotational theory
CPP 2019: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs

Call-by-push-value (CBPV) is an idealised calculus for functional and imperative programming, introduced as a subsuming paradigm for both call-by-value (CBV) and call-by-name (CBN). We formalise weak and strong operational semantics for (effect-free) ...
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs

The completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
Denotational semantics of recursive types in synthetic guarded domain theory
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for reasoning operationally about programming languages with advanced features including general ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

TPHOLs '09: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics

August 2009

515 pages

ISBN:9783642033582

Editors:
Stefan Berghofer
Institut für Informatik, Technische Universität München, Garching, Germany 85748
,
Tobias Nipkow
Institut für Informatik, Technische Universität München, Garching, Germany 85748
,
Christian Urban
Institut für Informatik, Technische Universität München, Garching, Germany 85748
,
Makarius Wenzel
Institut für Informatik, Technische Universität München, Garching, Germany 85748

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 August 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Harrison WBlumenfeld IBond EHathhorn CLi PTorrence MZiegler J(2023)Formalized High Level Synthesis with Applications to Cryptographic HardwareNASA Formal Methods10.1007/978-3-031-33170-1_20(332-352)Online publication date: 16-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-33170-1_20
Kaarsgaard RVeltri N(2019)En Garde! Unguarded Iteration for Reversible Computation in the Delay MonadMathematics of Program Construction10.1007/978-3-030-33636-3_13(366-384)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-33636-3_13
Pardo AGunther EPagano MViera MSabel DThiemann P(2018)An Internalist Approach to Correct-by-Construction CompilersProceedings of the 20th International Symposium on Principles and Practice of Declarative Programming10.1145/3236950.3236965(1-12)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1145/3236950.3236965
Gadea AGunther EPagano M(2017)The importance of being ExtrinsicProceedings of the 21st Brazilian Symposium on Programming Languages10.1145/3125374.3125378(1-8)Online publication date: 21-Sep-2017
https://dl.acm.org/doi/10.1145/3125374.3125378
Altenkirch TDanielsson NKraus N(2017)Partiality, RevisitedProceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 1020310.1007/978-3-662-54458-7_31(534-549)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54458-7_31
Møgelberg RPaviotti MKoskinen EGrohe MShankar N(2016)Denotational semantics of recursive types in synthetic guarded domain theoryProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934516(317-326)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934516
Chapman JUustalu TVeltri N(2015)Quotienting the Delay Monad by Weak BisimilarityProceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 939910.1007/978-3-319-25150-9_8(110-125)Online publication date: 29-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-319-25150-9_8
Kriener JKing ABlazy SPeña RSchrijvers T(2013)Proofs you can believe inProceedings of the 15th Symposium on Principles and Practice of Declarative Programming10.1145/2505879.2505886(37-48)Online publication date: 16-Sep-2013
https://dl.acm.org/doi/10.1145/2505879.2505886
Vytiniotis DPeyton Jones SClaessen KRosén D(2013)HALOACM SIGPLAN Notices10.1145/2480359.242912148:1(431-442)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429121
Vytiniotis DPeyton Jones SClaessen KRosén DGiacobazzi RCousot R(2013)HALOProceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2429069.2429121(431-442)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2429069.2429121
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten