Skip to main content
TudRepo
Research repository
Education Repository
Cultural Heritage
About
·
How to search
·
How to upload
Include full text
Search results
Back
Searched for: +
(1 - 8 of 8)
Document type
Date
List view
Grid view
Print
Email
export CSV
export Excel
Formally proving the correctness of the (un)currying refactoring: Using Agda with a simple Haskell-like programming language
Proving correctness of refactoring tuples to records: A correct-by-construction approach on a Haskell-like language
The monad and examples from Haskell: A computer-checked library for Category Theory in Lean
Practical Verification of Lenses: Implementing Formally Verified Lenses using agda2hs
Practical Verification of the Reader Monad
Practical Verification of Infinite Structures in agda2hs
Deriving a Symbolic Executor for Definitional Interpreters Suitable for the Study of Heuristics
Validating Definitional Interpreters Using Property-Based Testing
Searched for: +
(1 - 8 of 8)
Document type
Date
List view
Grid view
Print
Email
export CSV
export Excel