Events2Join

A Practical Formalization of Monadic Equational Reasoning ...


Equational Reasoning and Term Rewriting Systems - CiteSeerX

If we formalize the inference rules in a slightly di erent way, this is accomplished. Corresponding to a rewrite rule s !t we have the inference rule. A[s ] t !

Modular Reasoning about Interference in Incremental Programming

MRI models inheritance with mixins and side-effects with monads. It comes with a range of powerful reasoning techniques: equational reasoning, ...

Page 38 - 2017 Brochure

We focus on developing practical formal practical aspects of the analysis of ... equational reasoning, in which every step is of mathematical integers ...

Formalizing Domains, Ultrametric Spaces and Semantics ... - Microsoft

In Section 6, we define the semantics of an untyped call-by-value language using a particular recursive domain found in the Kleisli category for our lift monad, ...

View of Relative Monads Formalised

This formalisation work is motivated by a number of basic observa-tions.First of all, by moving from a conventional functional programming language likeHaskell ...

Syntax Monads for the Working Formal Metatheorist | alphaXiv

As implementations scale in complexity to realistic formalizations ... These structures admit a string-diagram calculus, which aids in equational reasoning.

Algorithmics - OPUS

... monadic equational reasoning. In: Inter- national Conference on Functional Programming, pp. 2–14 (2011). https://doi. org/10.1145/2034773.2034777. 78 ...

Dependent Types and Multi-Monadic Effects in F

This illustrates that F? is flexible enough to allow programmers to use memory abstractions of their own. (4) We have formalized a core calculus ...

Dexter Kozen's Publications - CS@Cornell

Kleene Algebra & Logic. Noam Zilberstein, Dexter Kozen, Alexandra Silva, and Joseph Tassarotti. A demonic outcome logic for randomized nondeterminism. Technical ...

(PDF) Preface to the special issue: Interactive theorem proving and ...

... equational reasoning in the 1970's and 1980's. The ensuing rewriting technology is now an unavoidable component of modern proof systems. A completely ...

A high-level perspective on de Bruijn encoding

Foundations for the practical formalization of mathematics (FPFM) ... `Monadic' fusion laws. `Classical' fusion laws [Huet]. Page 19. De ...

Matching Logic Explained∗ - · Formal Systems Laboratory

– In Section 8 we define a basic process algebra in ML. – In Section 9 we use ML for higher-order reasoning in category theory and define ...

Formalizing Category Theory in Agda - Computing & Software

requires equational reasoning, even as simple as applying sym to assoc, then we need to add that equation as a law. In other words, our laws ...

A Logical Relation for Monadic Encapsulation of State - Pure

We have formalized the whole technical development, including all proofs of the equations ... work is needed to establish soundness of equational reasoning ...

Modules over monads and initial semantics - CORE

These equations express exactly that the following defines a functor. Definition 10 (Kleisli extension). We define the Kleisli extension of M, M ...

On the correctness of monadic backward induction

(2017a). Apart from the increased level of generality, the definition of val and Bellman are in fact just an Idris formalisation of Bellman's equation as ...

Prolegomena to a Theory of Formal Reasoning - DTIC

used in Al by explaining how tr~ditionaI Ideas of logic can be mechanized in a practical way. The paper — presents sevcral new ideas. iach ...

Formal categorical reasoning - TÜBİTAK Academic Journals

We conclude, in Section 3, with a case study where we discuss a Coq formalized proof of soundness for the intuitionistic propositional logic.

Formalization of Logic in the Isabelle Proof Assistant

example, they need to reason about the limit of fair infinite sequences of sets of equations and ... of Practical Logic and Automated Reasoning [ ...

arXiv:1601.04299v1 [cs.PL] 17 Jan 2016 - IRIT

Our formalization provides one of the many steps involved, providing a monad structure on an initial algebra of a rank-2 endofunctor ...