• Tušil J and Obdržálek J. Minuska: Towards a Formally Verified Programming Language Framework. Software Engineering and Formal Methods. (200-214).

    https://doi.org/10.1007/978-3-031-77382-2_12

  • Galasso S and Cimini M. Language-parameterized Proofs for Functional Languages with Subtyping. Functional and Logic Programming. (291-310).

    https://doi.org/10.1007/978-981-97-2300-3_15

  • Alshnakat A, Lundberg D, Guanciale R and Dam M. (2024). HOL4P4: Mechanized Small-Step Semantics for P4. Proceedings of the ACM on Programming Languages. 8:OOPSLA1. (223-249). Online publication date: 29-Apr-2024.

    https://doi.org/10.1145/3649819

  • Liu Y and Weirich S. (2023). Dependently-Typed Programming with Logical Equality Reflection. Proceedings of the ACM on Programming Languages. 7:ICFP. (649-685). Online publication date: 30-Aug-2023.

    https://doi.org/10.1145/3607852

  • Cimini M. Testing Languages with a Languages-as-Databases Approach. Tests and Proofs. (108-126).

    https://doi.org/10.1007/978-3-031-38828-6_7

  • Park J, Youn D, Lee K and Ryu S. (2023). Feature-Sensitive Coverage for Conformance Testing of Programming Language Implementations. Proceedings of the ACM on Programming Languages. 7:PLDI. (493-515). Online publication date: 6-Jun-2023.

    https://doi.org/10.1145/3591240

  • Alshnakat A, Lundberg D, Guanciale R, Dam M and Palmskog K. HOL4P4. Proceedings of the 5th International Workshop on P4 in Europe. (39-45).

    https://doi.org/10.1145/3565475.3569081

  • Ambal G, Lenglet S, Schmitt A and NoûS C. Certified Derivation of Small-Step From Big-Step Skeletal Semantics. Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming. (1-48).

    https://doi.org/10.1145/3551357.3551384

  • Cheney J and Fernandez M. Nominal Matching Logic. Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming. (1-15).

    https://doi.org/10.1145/3551357.3551375

  • Ahrens B, Matthes R and Mörtberg A. Implementing a category-theoretic framework for typed abstract syntax. Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs. (307-323).

    https://doi.org/10.1145/3497775.3503678

  • Frolich D and van Binsbergen L. A Generic Back-End for Exploratory Programming. Trends in Functional Programming. (24-43).

    https://doi.org/10.1007/978-3-030-83978-9_2

  • Doenges R, Arashloo M, Bautista S, Chang A, Ni N, Parkinson S, Peterson R, Solko-Breslin A, Xu A and Foster N. (2021). Petr4: formal foundations for p4 data planes. Proceedings of the ACM on Programming Languages. 5:POPL. (1-32). Online publication date: 4-Jan-2021.

    https://doi.org/10.1145/3434322

  • Eisenberg R. Stitch: the sound type-indexed type checker (functional pearl). Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell. (39-53).

    https://doi.org/10.1145/3406088.3409015

  • Fragoso Santos J, Maksimović P, Ayoun S and Gardner P. Gillian, part i: a multi-language platform for symbolic execution. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. (927-942).

    https://doi.org/10.1145/3385412.3386014

  • Keidel S and Erdweg S. A Systematic Approach to Abstract Interpretation of Program Transformations. Verification, Model Checking, and Abstract Interpretation. (136-157).

    https://doi.org/10.1007/978-3-030-39322-9_7

  • Johnstone A and Scott E. Principled and Pragmatic Specification of Programming Languages. Formal Methods Teaching. (165-180).

    https://doi.org/10.1007/978-3-030-32441-4_11

  • Miller D. (2019). Mechanized Metatheory Revisited. Journal of Automated Reasoning. 63:3. (625-665). Online publication date: 1-Oct-2019.

    https://doi.org/10.1007/s10817-018-9483-3

  • Weirich S, Choudhury P, Voizard A and Eisenberg R. (2019). A role for dependent types in Haskell. Proceedings of the ACM on Programming Languages. 3:ICFP. (1-29). Online publication date: 26-Jul-2019.

    https://doi.org/10.1145/3341705

  • Bodin M, Gardner P, Jensen T and Schmitt A. (2019). Skeletal semantics and their interpretations. Proceedings of the ACM on Programming Languages. 3:POPL. (1-31). Online publication date: 2-Jan-2019.

    https://doi.org/10.1145/3290357

  • Blanchette J, Gheri L, Popescu A and Traytel D. (2019). Bindings as bounded natural functors. Proceedings of the ACM on Programming Languages. 3:POPL. (1-34). Online publication date: 2-Jan-2019.

    https://doi.org/10.1145/3290335

  • van Antwerpen H, Bach Poulsen C, Rouvoet A and Visser E. (2018). Scopes as types. Proceedings of the ACM on Programming Languages. 2:OOPSLA. (1-30). Online publication date: 24-Oct-2018.

    https://doi.org/10.1145/3276484

  • Yang Y and Oliveira B. (2017). Unifying typing and subtyping. Proceedings of the ACM on Programming Languages. 1:OOPSLA. (1-26). Online publication date: 12-Oct-2017.

    https://doi.org/10.1145/3133871

  • Gheri L and Popescu A. A Formalized General Theory of Syntax with Bindings. Interactive Theorem Proving. (241-261).

    https://doi.org/10.1007/978-3-319-66107-0_16

  • Pombrio J, Krishnamurthi S and Wand M. (2017). Inferring scope through syntactic sugar. Proceedings of the ACM on Programming Languages. 1:ICFP. (1-28). Online publication date: 29-Aug-2017.

    https://doi.org/10.1145/3110288

  • Weirich S, Voizard A, de Amorim P and Eisenberg R. (2017). A specification for dependent types in Haskell. Proceedings of the ACM on Programming Languages. 1:ICFP. (1-29). Online publication date: 29-Aug-2017.

    https://doi.org/10.1145/3110275

  • Pottier F. (2017). Visitors unchained. Proceedings of the ACM on Programming Languages. 1:ICFP. (1-28). Online publication date: 29-Aug-2017.

    https://doi.org/10.1145/3110272

  • Keuchel S, Weirich S and Schrijvers T. Needle & Knot. Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632. (419-445).

    https://doi.org/10.1007/978-3-662-49498-1_17

  • Grewe S, Erdweg S, Wittmann P and Mezini M. Type systems for the masses: deriving soundness proofs and efficient checkers. 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!). (137-150).

    https://doi.org/10.1145/2814228.2814239

  • Bessai J, Düdder B, Heineman G and Rehof J. Combinatory Synthesis of Classes Using Feature Grammars. Revised Selected Papers of the 12th International Conference on Formal Aspects of Component Software - Volume 9539. (123-140).

    https://doi.org/10.1007/978-3-319-28934-2_7

  • Sjöberg V and Weirich S. (2015). Programming up to Congruence. ACM SIGPLAN Notices. 50:1. (369-382). Online publication date: 11-May-2015.

    https://doi.org/10.1145/2775051.2676974

  • Eisenberg R and Stolarek J. (2014). Promoting functions to type families in Haskell. ACM SIGPLAN Notices. 49:12. (95-106). Online publication date: 11-May-2015.

    https://doi.org/10.1145/2775050.2633361

  • Popescu A and Roşu G. (2015). Term-generic logic. Theoretical Computer Science. 577:C. (1-24). Online publication date: 27-Apr-2015.

    https://doi.org/10.1016/j.tcs.2015.01.047

  • Sjöberg V and Weirich S. Programming up to Congruence. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (369-382).

    https://doi.org/10.1145/2676726.2676974

  • Stansifer P and Wand M. (2014). Romeo. ACM SIGPLAN Notices. 49:9. (53-65). Online publication date: 26-Nov-2014.

    https://doi.org/10.1145/2692915.2628162

  • Mulligan D, Owens S, Gray K, Ridge T and Sewell P. (2014). Lem. ACM SIGPLAN Notices. 49:9. (175-188). Online publication date: 26-Nov-2014.

    https://doi.org/10.1145/2692915.2628143

  • Visser E, Wachsmuth G, Tolmach A, Neron P, Vergu V, Passalaqua A and Konat G. A Language Designer's Workbench. Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software. (95-111).

    https://doi.org/10.1145/2661136.2661149

  • Eisenberg R and Stolarek J. Promoting functions to type families in Haskell. Proceedings of the 2014 ACM SIGPLAN symposium on Haskell. (95-106).

    https://doi.org/10.1145/2633357.2633361

  • Stansifer P and Wand M. Romeo. Proceedings of the 19th ACM SIGPLAN international conference on Functional programming. (53-65).

    https://doi.org/10.1145/2628136.2628162

  • Mulligan D, Owens S, Gray K, Ridge T and Sewell P. Lem. Proceedings of the 19th ACM SIGPLAN international conference on Functional programming. (175-188).

    https://doi.org/10.1145/2628136.2628143

  • Anand A and Rahli V. A Generic Approach to Proofs about Substitution. Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice. (1-8).

    https://doi.org/10.1145/2631172.2631177

  • Churchill M, Mosses P and Torrini P. Reusable components of semantic specifications. Proceedings of the 13th international conference on Modularity. (145-156).

    https://doi.org/10.1145/2577080.2577099

  • Backes M, Hriţcu C and Maffei M. (2014). Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations. Journal of Computer Security. 22:2. (301-353). Online publication date: 1-Mar-2014.

    /doi/10.5555/2595841.2595845

  • Casinghino C, Sjöberg V and Weirich S. (2014). Combining proofs and programs in a dependently typed language. ACM SIGPLAN Notices. 49:1. (33-45). Online publication date: 13-Jan-2014.

    https://doi.org/10.1145/2578855.2535883

  • Bodin M, Chargueraud A, Filaretti D, Gardner P, Maffeis S, Naudziuniene D, Schmitt A and Smith G. (2014). A trusted mechanised JavaScript specification. ACM SIGPLAN Notices. 49:1. (87-100). Online publication date: 13-Jan-2014.

    https://doi.org/10.1145/2578855.2535876

  • Stump A. The recursive polarized dual calculus. Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification. (3-14).

    https://doi.org/10.1145/2541568.2541575

  • Casinghino C, Sjöberg V and Weirich S. Combining proofs and programs in a dependently typed language. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (33-45).

    https://doi.org/10.1145/2535838.2535883

  • Bodin M, Chargueraud A, Filaretti D, Gardner P, Maffeis S, Naudziuniene D, Schmitt A and Smith G. A trusted mechanised JavaScript specification. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (87-100).

    https://doi.org/10.1145/2535838.2535876

  • Mai Thuong Tran T, Steffen M and Truong H. Compositional Static Analysis for Implicit Join Synchronization in a Transactional Setting. Proceedings of the 11th International Conference on Software Engineering and Formal Methods - Volume 8137. (212-228).

    https://doi.org/10.1007/978-3-642-40561-7_15

  • Polonowski E. Automatically generated infrastructure for de bruijn syntaxes. Proceedings of the 4th international conference on Interactive Theorem Proving. (402-417).

    https://doi.org/10.1007/978-3-642-39634-2_29

  • Ševčík J, Vafeiadis V, Zappa Nardelli F, Jagannathan S and Sewell P. (2013). CompCertTSO. Journal of the ACM. 60:3. (1-50). Online publication date: 1-Jun-2013.

    https://doi.org/10.1145/2487241.2487248

  • Bettini L. Implementing Java-like languages in Xtext with Xsemantics. Proceedings of the 28th Annual ACM Symposium on Applied Computing. (1559-1564).

    https://doi.org/10.1145/2480362.2480654

  • Clouston R. Generalised name abstraction for nominal sets. Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures. (434-449).

    https://doi.org/10.1007/978-3-642-37075-5_28

  • Lee G, Oliveira B, Cho S and Yi K. GMETA. Proceedings of the 21st European conference on Programming Languages and Systems. (436-455).

    https://doi.org/10.1007/978-3-642-28869-2_22

  • Weirich S, Yorgey B and Sheard T. Binders unbound. Proceedings of the 16th ACM SIGPLAN international conference on Functional programming. (333-345).

    https://doi.org/10.1145/2034773.2034818

  • Swamy N, Chen J, Fournet C, Strub P, Bhargavan K and Yang J. Secure distributed programming with value-dependent types. Proceedings of the 16th ACM SIGPLAN international conference on Functional programming. (266-278).

    https://doi.org/10.1145/2034773.2034811

  • Weirich S, Yorgey B and Sheard T. (2011). Binders unbound. ACM SIGPLAN Notices. 46:9. (333-345). Online publication date: 18-Sep-2011.

    https://doi.org/10.1145/2034574.2034818

  • Swamy N, Chen J, Fournet C, Strub P, Bhargavan K and Yang J. (2011). Secure distributed programming with value-dependent types. ACM SIGPLAN Notices. 46:9. (266-278). Online publication date: 18-Sep-2011.

    https://doi.org/10.1145/2034574.2034811

  • Bettini L. A DSL for writing type systems for Xtext languages. Proceedings of the 9th International Conference on Principles and Practice of Programming in Java. (31-40).

    https://doi.org/10.1145/2093157.2093163

  • Owens S, Böhm P, Nardelli F and Sewell P. Lem. Proceedings of the Second international conference on Interactive theorem proving. (363-369).

    /doi/10.5555/2033939.2033970

  • Krebbers R and Wiedijk F. A formalization of the C99 standard in HOL, isabelle and Coq. Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics. (301-303).

    /doi/10.5555/2032713.2032744

  • Urban C and Kaliszyk C. General bindings and alpha-equivalence in nominal Isabelle. Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software. (480-500).

    /doi/10.5555/1987211.1987236

  • Ŝevčik J, Vafeiadis V, Zappa Nardelli F, Jagannathan S and Sewell P. Relaxed-memory concurrency and verified compilation. Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (43-54).

    https://doi.org/10.1145/1926385.1926393

  • Ŝevčik J, Vafeiadis V, Zappa Nardelli F, Jagannathan S and Sewell P. (2011). Relaxed-memory concurrency and verified compilation. ACM SIGPLAN Notices. 46:1. (43-54). Online publication date: 26-Jan-2011.

    https://doi.org/10.1145/1925844.1926393

  • Zhao J, Zhang Q and Zdancewic S. Relational parametricity for a polymorphic linear lambda calculus. Proceedings of the 8th Asian conference on Programming languages and systems. (344-359).

    /doi/10.5555/1947873.1947906