LambdaY-calculus with priorities
Article No.: 20, Pages 1 - 13
Abstract
The lambdaY-calculus with priorities is a variant of the simply-typed lambda calculus designed for higher-order model-checking. The higher-order model-checking problem asks if a given parity tree automaton accepts the Böhm tree of a given term of the simply-typed lambda calculus with recursion. We show that this problem can be reduced to the same question but for terms of lambdaY-calculus with priorities and visibly parity automata; a subclass of parity automata. The latter question can be answered by evaluating terms in a simple powerset model with least and greatest fixpoints. We prove that the recognizing power of powerset models and visibly parity automata are the same. So, up to conversion to the lambdaY-calculus with priorities, powerset models with least and greatest fixpoints are indeed the right semantic framework for the model-checking problem. The reduction to lambdaY-calculus with priorities is also efficient algorithmically: it gives an algorithm of the same complexity as direct approaches to the higher-order model-checking problem. This indicates that the task of calculating the value of a term in a powerset model is a central algorithmic problem for higher-order model-checking.
References
[1]
N. Kobayashi, "Model checking higher-order programs," J. ACM, vol. 60, no. 3, p. 20, 2013.
[2]
T. Tsukada and N. Kobayashi, "Untyped recursion schemes and infinite intersection types," in FOSSACS'10, ser. LNCS, vol. 6014, 2010, pp. 343--357.
[3]
A. Murase, T. Terauchi, N. Kobayashi, R. Sato, and H. Unno, "Temporal verification of higher-order functional programs," in POPL'16, 2016, pp. 57--68.
[4]
Y. Nanjo, H. Unno, E. Koskinen, and T. Terauchi, "A fixpoint logic and dependent effects for temporal property verification," in LICS'18, 2018, pp. 759--768.
[5]
H. Unno, Y. Satake, and T. Terauchi, "Relatively complete refinement type system for verification of higher-order non-deterministic programs," PACMPL, vol. 2, no. POPL, pp. 12:1--12:29, 2018.
[6]
C.-H. L. Ong, "On model-checking trees generated by higher-order recursion schemes," in LICS, 2006, pp. 81--90.
[7]
M. Hague, A. S. Murawski, C. L. Ong, and O. Serre, "Collapsible pushdown automata and recursion schemes," ACM Trans. Comput. Log., vol. 18, no. 3, pp. 25:1--25:42, 2017.
[8]
N. Kobayashi and L. Ong, "A type system equivalent to modal mucalculus model checking of recursion schemes," in LICS, 2009, pp. 179--188.
[9]
S. Salvati and I. Walukiewicz, "Krivine machines and higher-order schemes," Inf. Comput., vol. 239, pp. 340--355, 2014.
[10]
T. Tsukada and C. L. Ong, "Compositional higher-order model checking via ω-regular games over böhm trees," in CSL-LICS '14. ACM, 2014, p. 78.
[11]
C. Grellois and P. Melliès, "Finitary semantics of linear logic and higher-order model-checking," in MFCS'15, ser. LNCS, vol. 9234, 2015, pp. 256--268.
[12]
S. Salvati and I. Walukiewicz, "A Model for Behavioural Properties of Higher-order Programs," in CSL'15, ser. LIPIcs, vol. 41, 2015, pp. 229--243.
[13]
S. Salvati, "Recognizability in the simply typed lambda-calculus," in WoLLIC, ser. LNCS, vol. 5514, 2009, pp. 48--60.
[14]
S. Salvati and I. Walukiewicz, "Evaluation is MSOL-compatible," in FSTTCS 2013, ser. LIPIcs, vol. 24, 2013, pp. 103--114.
[15]
S. Salvati and I. Walukiewicz, "Using models to model-check recursive schemes," Logical Methods in Computer Science, vol. 11, no. 2, 2015.
[16]
K. Aehlig, "A finite semantics of simply-typed lambda terms for infinite runs of automata," Logical Methods in Computer Science, vol. 3, no. 1, pp. 1--23, 2007.
[17]
P. Melliès, "Higher-order verification," June, 2014, workshop on Abstraction and Verification in Semantics. A part of IHP semester on Semantics of proofs and certified mathematics (Paris, France).
[18]
N. Kobayashi and C.-H. L. Ong, "Complexity of model checking recursion schemes for fragments of the modal mu-calculus," Logical Methods in Computer Science, vol. 7, no. 4, 2011.
[19]
N. Kobayashi, É. Lozes, and F. Bruse, "On the relationship between higher-order recursion schemes and higher-order fixpoint logic." in POPL'17, 2017, pp. 246--259.
[20]
C. Grellois, "Semantics of linear logic and higher-order model-checking. (sémantique de la logique linéaire et "model-checking" d'ordre supérieur)," Ph.D. dissertation, Paris Diderot University, France, 2016.
[21]
F. Bruse, "Alternating parity krivine automata," in MFCS, ser. LNCS, vol. 8634, 2014, pp. 111--122.
[22]
P. Melliès, "Higher-order parity automata," in LICS, 2017, pp. 1--12.
[23]
R. Suzuki, K. Fujima, N. Kobayashi, and T. Tsukada, "Streett automata model checking of higher-order recursion schemes," in FSCD' 2017, ser. LIPIcs, vol. 84, 2017, pp. 32:1--32:18.
[24]
M. Hague, R. Meyer, and S. Muskalla, "Domains for higher-order games," in MFCS'17, ser. LIPIcs, vol. 83, 2017, pp. 59:1--59:15.
[25]
M. Hague, R. Meyer, S. Muskalla, and M. Zimmermann, "Parity to safety in polynomial time for pushdown and collapsible pushdown systems," in MFCS'18, ser. LIPIcs, vol. 117, 2018, pp. 57:1--57:15.
[26]
I. Walukiewicz, "LambdaY-Calculus With Priorities," HAL, Tech. Rep., Apr. 2019, https://hal.archives-ouvertes.fr/hal-02100196.
[27]
R. M. Amadio and P.-L. Curien, Domains and Lambda-Calculi, ser. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
[28]
N. Kobayashi, K. Matsuda, and A. Shinohara, "Functional programs as compressed data," in Workshop on Partial Evaluation and Program Manipulation, PEPM 2012. ACM, 2012, pp. 121--130.
[29]
A. Haddad, "Model checking and functional program transformations," in FSTTCS, ser. LIPIcs, vol. 24, 2013, pp. 115--126.
[30]
S. van Bakel, "The heart of intersection type assignment: Normalisation proofs revisited," Theor. Comput. Sci., vol. 398, no. 1-3, pp. 82--94, 2008.
[31]
S. Salvati and I. Walukiewicz, "Simply typed fixpoint calculus and collapsible pushdown automata," Mathematical Structures in Computer Science, vol. 26, no. 7, pp. 1304--1350, 2016.
[32]
N. Kobayashi and C.-H. L. Ong, "Complexity of model checking recursion schemes for fragments of the modal mu-calculus," Logical Methods in Computer Science, vol. 7, no. 4, 2011.
[33]
A. Haddad, "IO vs OI in higher-order recursion schemes," in FICS, ser. EPTCS, vol. 77, 2012, pp. 23--30.
[34]
F. Bruse, O. Friedmann, and M. Lange, "On guarded transformation in the modal μ-calculus," Logic Journal of the IGPL, vol. 23, no. 2, pp. 194--216, 2015.
[35]
R. Sato and N. Kobayashi, "Modular verification of higher-order functional programs," in ESOP'17, ser. LNCS, vol. 10201, 2017, pp. 831--854.
[36]
P. Clairambault, C. Grellois, and A. S. Murawski, "Linearity in higher-order recursion schemes," PACMPL, vol. 2, no. POPL, pp. 39:1--39:29, 2018.
[37]
N. Kobayashi, T. Tsukada, and K. Watanabe, "Higher-order program verification via HFL model checking," in ESOP'18, ser. LNCS, vol. 10801, 2018, pp. 711--738.
Index Terms
- LambdaY-calculus with priorities
Index terms have been assigned to the content through auto-classification.
Recommendations
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value
PPDP '16: Proceedings of the 18th International Symposium on Principles and Practice of Declarative ProgrammingWe introduce and study the Bang Calculus, an untyped functional calculus in which the promotion operation of Linear Logic is made explicit and where application is a bilinear operation. This calculus, which can be understood as an untyped version of ...
Formalization of the Resolution Calculus for First-Order Logic
I present a formalization in Isabelle/HOL of the resolution calculus for first-order logic with formal soundness and completeness proofs. To prove the calculus sound, I use the substitution lemma, and to prove it complete, I use Herbrand interpretations ...
Comments
Information & Contributors
Information
Published In
Sponsors
In-Cooperation
- EACSL: European Association for Computer Science Logic
- IEEE-CS\DATC: IEEE Computer Society
Publisher
IEEE Press
Publication History
Published: 08 June 2021
Check for updates
Qualifiers
- Research-article
Conference
LICS '19
Sponsor:
LICS '19: 34th Annual ACM/IEEE Symposium on Logic in Computer Science
June 24 - 27, 2019
Vancouver, Canada
Acceptance Rates
Overall Acceptance Rate 215 of 622 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 11Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Reflects downloads up to 11 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in