Ott
From MaRDI portal
Software:13417
No author found.
Related Items (31)
Safe zero-cost coercions for Haskell ⋮ A Rewriting Logic Approach to Type Inference ⋮ Encoding abstract syntax without fresh names ⋮ Mechanized semantics for the clight subset of the C language ⋮ αCheck: A mechanized metatheory model checker ⋮ Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax ⋮ Operational Reasoning for Concurrent Caml Programs and Weak Memory Models ⋮ Romeo: A system for more flexible binding-safe programming ⋮ Dualized Simple Type Theory ⋮ An ACL2 Tutorial ⋮ A Brief Overview of HOL4 ⋮ Secure distributed programming with value-dependent types ⋮ Executable component-based semantics ⋮ A formalized general theory of syntax with bindings: extended version ⋮ Binding operators for nominal sets ⋮ A trusted mechanised JavaScript specification ⋮ Secure distributed programming with value-dependent types ⋮ Binders unbound ⋮ A Formalization of the C99 Standard in HOL, Isabelle and Coq ⋮ BNF-style notation as it is actually used ⋮ On the effectiveness of higher-order logic programming in language-oriented programming ⋮ System description: lang-n-change -- a tool for transforming languages ⋮ Formalising and Verifying Reference Attribute Grammars in Coq ⋮ General Bindings and Alpha-Equivalence in Nominal Isabelle ⋮ Implementing type systems for the IDE with Xsemantics ⋮ Lem: A Lightweight Tool for Heavyweight Semantics ⋮ Mechanized metatheory revisited ⋮ Program verification by coinduction ⋮ Dynamic structural operational semantics ⋮ Term-generic logic ⋮ \texttt{slepice}: towards a verified implementation of type theory in type theory
This page was built for software: Ott
