About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit
Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

More...

Conference paper

Tautology Checkers in Isabelle and Haskell

In Ceur Workshop Proceedings — 2020, pp. 327-341

By Villadsen, Jørgen1,2

Edited by Zumpano, Ester; Calimeri, Francesco; Perri, Simona

From

Algorithms and Logic, Department of Applied Mathematics and Computer Science, Technical University of Denmark1

Department of Applied Mathematics and Computer Science, Technical University of Denmark2

With the purpose of teaching functional programming and automated reasoning to computer science students, we formally verify a sound, complete and terminating tautology checker in Isabelle with code generation to Haskell. We describe a series of approaches and finish with a formalization based on formulas in negation normal form where the Isabelle/HOL functions consist of just 4 lines and the Isabelle/HOL proofs also consist of just 4 lines.

We investigate the generated Haskell code and present a 24-line manually assembled program.

Language: English
Publisher: CEUR-WS
Year: 2020
Pages: 327-341
Proceedings: 35<sup>th</sup> Edition of the Italian Conference on Computational Logic
Series: Ceur Workshop Proceedings
ISSN: 16130073
Types: Conference paper
ORCIDs: Villadsen, Jørgen

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis