Open Higher-Order Logic

Authors Ugo Dal Lago , Francesco Gavazzo , Alexis Ghyselen

Thumbnail PDF


  • Filesize: 0.85 MB
  • 17 pages

Document Identifiers

Author Details

Ugo Dal Lago
  • Department of Computer Science and Engineering, University of Bologna, Italy
Francesco Gavazzo
  • Department of Computer Science, University of Pisa, Italy
Alexis Ghyselen
  • Department of Computer Science and Engineering, University of Bologna, Italy

Cite AsGet BibTex

Ugo Dal Lago, Francesco Gavazzo, and Alexis Ghyselen. Open Higher-Order Logic. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 252, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


We introduce a variation on Barthe et al.’s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity, differentiability, or monotonicity, can be expressed and reasoned about in a very natural way, following the structure of the underlying program. We give open higher-order logic in distinct flavors, and in particular in its relational and local versions, the latter being tailored for situations in which properties hold only in part of the underlying function’s domain of definition.

Subject Classification

ACM Subject Classification
  • Theory of computation → Higher order logic
  • Theory of computation → Logic and verification
  • Formal Verification
  • Relational Logic
  • First-Order Properties


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Alejandro Aguirre, Gilles Barthe, Lars Birkedal, Aleš Bizjak, Marco Gaboardi, and Deepak Garg. Relational reasoning for markov chains in a probabilistic guarded lambda calculus. In Proc. of ESOP 2018, volume 10801 of LNCS, pages 214-241. Springer, 2018. URL:
  2. Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, and Pierre-Yves Strub. A relational logic for higher-order programs. Proc. ACM Program. Lang., 1(ICFP):21:1-21:29, 2017. URL:
  3. Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, and Francesco Gavazzo. On the versatility of open logical relations: Continuity, automatic differentiation, and a containment theorem. In Proc. of ESOP 2020, volume 12075 of LNCS. Springer, 2020. URL:
  4. Edwin Brady. Idris, a general-purpose dependently typed programming language: Design and implementation. Journal of Functional Programming, 23(5):552-593, 2013. URL:
  5. Stephen A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing, 7(1):70-90, 1978. URL:
  6. Mario Coppo and Mariangiola Dezani-Ciancaglini. A new type assignment for lambda-terms. Archiv fur mathematische Logik und Grundlagenforschung, 19(1):139-156, 1978. URL:
  7. Ugo Dal Lago and Marco Gaboardi. Linear dependent types and relative completeness. In Proc. of LICS 2011, pages 133-142, 2011. URL:
  8. Ugo Dal Lago, Francesco Gavazzo, and Alexis Ghyselen. Open higher-order logic (long version), 2022. URL:
  9. Rowan Davies and Frank Pfenning. Intersection types and computational effects. In Proc. of ICFP 2000, pages 198-208, 2000. URL:
  10. Robert W Floyd. Assigning meanings to programs. In Program Verification, pages 65-81. Springer, 1993. Google Scholar
  11. Alejandro Aguirre Galindo. Relational Logics for Higher-Order Effectful Programs. Ph.D Thesis, 2020. Google Scholar
  12. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10):576-580, 1969. URL:
  13. Martin Hofmann. Linear types and non-size-increasing polynomial time computation. Information and Computation, 183(1):57-85, 2003. URL:
  14. Mathieu Huot, Sam Staton, and Matthijs Vákár. Correctness of automatic differentiation via diffeologies and categorical gluing. In Proc. of FoSSACS 2020, volume 12077 of LNCS, pages 319-338. Springer, 2020. Google Scholar
  15. Achim Jung and Jerzy Tiuryn. A new characterization of lambda definability. In Proc. of TLCA 1993, volume 664 of LNCS, pages 245-257. Springer, 1993. URL:
  16. Damiano Mazza and Michele Pagani. Automatic differentiation in PCF. Proc. ACM Program. Lang., 5(POPL):1-27, 2021. URL:
  17. Gordon Plotkin. Lambda-definability and logical relations. Memorandum SAI-RM-4, University of Edinburgh, 1973. Google Scholar
  18. Francois Pottier. A simple view of type-secure information flow in the pi-calculus. In Proc. of CSFW 2002, pages 320-330, 2002. URL:
  19. Tetsuya Sato, Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, and Justin Hsu. Formal verification of higher-order probabilistic programs: Reasoning about approximation, convergence, bayesian inference, and optimization. Proc. ACM Program. Lang., 3(POPL):38:1-38:30, 2019. URL:
  20. Amir Shaikhha, Andrew Fitzgibbon, Dimitrios Vytiniotis, and Simon Peyton Jones. Efficient differentiable programming in a functional array-processing language. Proc. ACM Program. Lang., 3(ICFP):97:1-97:30, 2019. URL:
  21. Richard Statman. Logical relations and the typed lambda-calculus. Information and Control, 65(2):85-97, 1985. URL:
  22. Sam Staton, Frank Wood, Hongseok Yang, Chris Heunen, and Ohad Kammar. Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In Proc. of LICS 2016, pages 525-534, 2016. URL: