Relatively Complete Refinement Type System for Verification of Higher-Order Non-Deterministic Programs

Proceedings of the ACM on Programming Languages
doi 10.1145/3158100
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Modular Verification of Higher-Order Methods With Mandatory Calls Specified by Model Programs

ACM SIGPLAN Notices
Computer Science
2007English

Modular Verification of Higher-Order Methods With Mandatory Calls Specified by Model Programs

2007English

Automated Techniques for Higher-Order Program Verification

Progress in Informatics
2013English

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Strong Non-Interference and Type-Directed Higher-Order Masking

2016English

Towards Strong Higher-Order Automation for Fast Interactive Verification

English

A Practical Type Analysis for Verification of Modular Prolog Programs

2008English

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

ACM SIGPLAN Notices
Computer Science
2015English

Higher-Order Unification Revisited: Complete Sets of Transformations

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy