implementation of a pragmatic translation from haskell
play

Implementation of a Pragmatic Translation from Haskell into - PowerPoint PPT Presentation

Sep 30, 2022 •279 likes •919 views

Implementation of a Pragmatic Translation from Haskell into Isabelle/HOL Patrick Bahr pa-ba@arcor.de NICTA Sydney, TU Wien December 17, 2008 Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 1 / 29

  1. Implementation of a Pragmatic Translation from Haskell into Isabelle/HOL Patrick Bahr pa-ba@arcor.de NICTA Sydney, TU Wien December 17, 2008 Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 1 / 29

  2. Outline Introduction 1 Haskell vs. Isabelle/HOL Motivation Goals Translating Haskell into Isabelle/HOL 2 Haskell vs. Isabelle/HOL Implementation Conclusions 3 Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 2 / 29

  3. Outline Introduction 1 Haskell vs. Isabelle/HOL Motivation Goals Translating Haskell into Isabelle/HOL 2 Haskell vs. Isabelle/HOL Implementation Conclusions 3 Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 3 / 29

  4. Haskell vs. Isabelle/HOL Haskell in a nutshell purely functional programming language non-strict semantics (mostly implemented by lazy evaluation) comprehensive type system: Hindley-Milner (restricted F ω ) + type classes uses monads to allow side effects Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 4 / 29

  5. Haskell vs. Isabelle/HOL Haskell in a nutshell purely functional programming language non-strict semantics (mostly implemented by lazy evaluation) comprehensive type system: Hindley-Milner (restricted F ω ) + type classes uses monads to allow side effects Isabelle/HOL in a nutshell Isabelle: generic theorem prover HOL: Isabelle formulation of classical higher-order logic based on simply typed lambda calculus (system F 1 ) � comparatively weak type system extended with type classes Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 4 / 29

  6. Haskell vs. Isabelle/HOL Haskell in a nutshell purely functional programming language non-strict semantics (mostly implemented by lazy evaluation) comprehensive type system: Hindley-Milner (restricted F ω ) + type classes uses monads to allow side effects Isabelle/HOL in a nutshell Isabelle: generic theorem prover HOL: Isabelle formulation of classical higher-order logic based on simply typed lambda calculus (system F 1 ) � comparatively weak type system extended with type classes more details when we come to the implementation Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 4 / 29

  7. Motivation Program verification Haskell’s semantics allows comparatively easy reasoning there is no theorem prover for Haskell! � translate Haskell into language of a generic theorem prover Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 5 / 29

  8. Motivation Program verification Haskell’s semantics allows comparatively easy reasoning there is no theorem prover for Haskell! � translate Haskell into language of a generic theorem prover Example: l4.verified project aim: formalisation and verification of a microkernel prototype implementation in Haskell translation into Isabelle/HOL � executable model reasoning about executable model in Isabelle/HOL Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 5 / 29

  9. Translation Goals cover a large subset of Haskell’s syntax result should be easily readable ◮ preserve syntactic structure as much as possible ◮ translate syntactic sugar as well keep reasoning simple � Isabelle/HOL Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 6 / 29

  10. Translation Goals cover a large subset of Haskell’s syntax result should be easily readable ◮ preserve syntactic structure as much as possible ◮ translate syntactic sugar as well keep reasoning simple � Isabelle/HOL � Translation is neither sound nor complete! Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 6 / 29

  11. Translation Goals cover a large subset of Haskell’s syntax result should be easily readable ◮ preserve syntactic structure as much as possible ◮ translate syntactic sugar as well keep reasoning simple � Isabelle/HOL � Translation is neither sound nor complete! Implementation implementation language: Haskell based on existing work from TU Munich Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 6 / 29

  12. Outline Introduction 1 Haskell vs. Isabelle/HOL Motivation Goals Translating Haskell into Isabelle/HOL 2 Haskell vs. Isabelle/HOL Implementation Conclusions 3 Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 7 / 29

  13. Haskell vs. Isabelle/HOL – Non-strictness/Partiality in Isabelle/HOL only total functions are definable � recursive definitions need termination proof Haskell is Turing-complete � partial functions definable Haskell’s semantics is non-strict Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 8 / 29

  14. Haskell vs. Isabelle/HOL – Non-strictness/Partiality in Isabelle/HOL only total functions are definable � recursive definitions need termination proof Haskell is Turing-complete � partial functions definable Haskell’s semantics is non-strict Example (Haskell) from :: Int -> [ Int ] from n = n : from (n+1) Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 8 / 29

  15. Haskell vs. Isabelle/HOL – Non-strictness/Partiality in Isabelle/HOL only total functions are definable � recursive definitions need termination proof Haskell is Turing-complete � partial functions definable Haskell’s semantics is non-strict Example (Haskell) from :: Int -> [ Int ] from n = n : from (n+1) from does not terminate for any input � not definable in Isabelle/HOL due to non-strictness this function is still usable in Haskell Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 8 / 29

  16. Haskell vs. Isabelle/HOL – Non-strictness/Partiality in Isabelle/HOL only total functions are definable � recursive definitions need termination proof Haskell is Turing-complete � partial functions definable Haskell’s semantics is non-strict Example (Haskell) from :: Int -> [ Int ] from n = n : from (n+1) from does not terminate for any input � not definable in Isabelle/HOL due to non-strictness this function is still usable in Haskell Example (Haskell) nPrimes :: Int -> [ Int ] nPrimes n = take n ( filter isPrime (from 1)) Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 8 / 29

  17. Haskell vs. Isabelle/HOL – Non-strictness/Partiality in Isabelle/HOL only total functions are definable � recursive definitions need termination proof Haskell is Turing-complete � partial functions definable Haskell’s semantics is non-strict Example (Haskell) from :: Int -> [ Int ] from n = n : from (n+1) from does not terminate for any input � not definable in Isabelle/HOL due to non-strictness this function is still usable in Haskell Example (Haskell) nPrimes :: Int -> [ Int ] nPrimes n = take n ( filter isPrime (from 1)) Definitions that depend on non-strictness have to be avoided! Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 8 / 29

  18. Haskell vs. Isabelle/HOL – Local Function Definitions Haskell allows recursive function definitions in local contexts (using let or where where ) in Isabelle/HOL recursive function definitions are only allowed at the top level Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 9 / 29

  19. Haskell vs. Isabelle/HOL – Local Function Definitions Haskell allows recursive function definitions in local contexts (using let or where where ) in Isabelle/HOL recursive function definitions are only allowed at the top level Example (Haskell) sumLen :: Int -> [a] -> [a] -> Int sumLen s l1 l2 = let len [] = 0 len (x:xs) = len xs + s in len l1 + len l2 Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 9 / 29

  20. Haskell vs. Isabelle/HOL – Local Function Definitions II local function definitions have to be moved to the top level closures have to be made explicit Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 10 / 29

  21. Haskell vs. Isabelle/HOL – Local Function Definitions II local function definitions have to be moved to the top level closures have to be made explicit Example (Isabelle/HOL) fun len1 where " len1 _ N i l = 0" | " len1 s ( x # xs ) = len1 s xs + s " fun sumLen : : " i n t = > ’ a l i s t = > ’ a l i s t = > i n t " where "sumLen s l 1 l 2 = ( l e t l e n = len1 s in l e n l 1 + l en l 2 )" Patrick Bahr (NICTA Sydney, TU Wien) Translating Haskell into Isabelle/HOL December 17, 2008 10 / 29

Recommend

Haskell-RL An Equational Specification of Haskell in Maude Andrew Bennett Presented on 24 April

Haskell-RL An Equational Specification of Haskell in Maude Andrew Bennett Presented on 24 April

Haskell-RL An Equational Specification of Haskell in Maude Andrew Bennett Presented on 24 April 2006 Summary Haskell / Haskell-RL Examples Supported Features Haskell-RL State Implementation Functions Data Types

631 views • 14 slides
A Haskell-Implementation of STM Haskell with Early Conflict Detection David Sabel

A Haskell-Implementation of STM Haskell with Early Conflict Detection David Sabel

A Haskell-Implementation of STM Haskell with Early Conflict Detection David Sabel Goethe-University, Frankfurt, Germany ATPS 2014, Kiel 1 Introduction Software Transactional Memory (STM) treats shared memory operations as transactions

325 views • 20 slides
Pragmatic Randomized Trials for D&I Dissemination and Implementation Conference Thursday

Pragmatic Randomized Trials for D&I Dissemination and Implementation Conference Thursday

Pragmatic Randomized Trials for D&I Dissemination and Implementation Conference Thursday December 5, 2019 Merrick Zwarenstein, Department of Family Medicine, Western University, Ontario, Canada Relationships with commercial interests: None

605 views • 27 slides
An overview of Haskell Haggai Eran 23/7/2007 Haggai Eran An overview of Haskell Introduction

An overview of Haskell Haggai Eran 23/7/2007 Haggai Eran An overview of Haskell Introduction

Introduction Features Haskell Implementation Summary An overview of Haskell Haggai Eran 23/7/2007 Haggai Eran An overview of Haskell Introduction Features Haskell Implementation Summary Outline Introduction 1 Nice Syntactic Features

1.38k views • 122 slides
De-Mystifying GASB 45 & Pragmatic Implementation of OPEB GFOAT April 14, 2014 Don Paschal

De-Mystifying GASB 45 & Pragmatic Implementation of OPEB GFOAT April 14, 2014 Don Paschal

De-Mystifying GASB 45 & Pragmatic Implementation of OPEB GFOAT April 14, 2014 Don Paschal Blessing & Curse City Staff Generally: - those who do not have retiree health care or implicit subsidy feel fortunate - those with a

278 views • 26 slides
A Haskell Implementation of Turing Machines Lim Shao En Zhang Licheng Computer Science

A Haskell Implementation of Turing Machines Lim Shao En Zhang Licheng Computer Science

A Haskell Implementation of Turing Machines Lim Shao En Zhang Licheng Computer Science Computability Theory A Haskell Implementation of Turing Machines Computability Theory Turing Machine Recursion theory Lambda-calculus Post

448 views • 22 slides
Pragmatic Agility Pragmatic Agility Presented by: Andy Hunt The Pragmatic Programmers

Pragmatic Agility Pragmatic Agility Presented by: Andy Hunt The Pragmatic Programmers

W11 Concurrent Session Wednesday 11/12/2008 12:45 PM 2:15 PM Pragmatic Agility Pragmatic Agility Presented by: Andy Hunt The Pragmatic Programmers Presented at: Agile Development Practices 2008 November 10 - 14, Orlando, FL., USA 330

61 views • 3 slides
Bringing Haskell to the World www.fpcomplete.com Experience Report Building Haskell Development

Bringing Haskell to the World www.fpcomplete.com Experience Report Building Haskell Development

Bringing Haskell to the World www.fpcomplete.com Experience Report Building Haskell Development and Deployment tools Gregg Lebovitz Director, Product Management FP Complete Company Goals Increase Haskell Adoption Make Haskell More

344 views • 21 slides
Correctness of an STM Haskell Implementation Manfred Schmidt-Schau, David Sabel

Correctness of an STM Haskell Implementation Manfred Schmidt-Schau, David Sabel

Correctness of an STM Haskell Implementation Manfred Schmidt-Schau, David Sabel Goethe-University, Frankfurt, Germany ICFP 13, Boston, USA 1 Introduction Software Transactional Memory (STM) treats shared memory operations as transactions

424 views • 16 slides
g n i t e e M l Dissemination, Implementation, Knowledge a u Translation, and Scale up

g n i t e e M l Dissemination, Implementation, Knowledge a u Translation, and Scale up

g n i t e e M l Dissemination, Implementation, Knowledge a u Translation, and Scale up of Nutrition and n Physical Activity Interventions in the Pursuit n of a Public Health Impact A 7 1 0 Paul A. Estabrooks, PhD 2 A Twitter:

803 views • 44 slides
Haskell Computer Algebra System Rob Tougher December 15, 2007 Rob Tougher Haskell Computer

Haskell Computer Algebra System Rob Tougher December 15, 2007 Rob Tougher Haskell Computer

Haskell Computer Algebra System Rob Tougher December 15, 2007 Rob Tougher Haskell Computer Algebra System Outline Tutorial Implementation Looking Back Rob Tougher Haskell Computer Algebra System Tutorial: Language Summary HCAS

591 views • 35 slides
The Design and Implementation of Scalable Parallel Haskell Malak Aljabri, Phil Trinder,and

The Design and Implementation of Scalable Parallel Haskell Malak Aljabri, Phil Trinder,and

The Design and Implementation of Scalable Parallel Haskell Malak Aljabri, Phil Trinder,and Hans-Wolfgang Loidl MMnet13: Language and Runtime Support for Concurrent Systems Heriot Watt University May 8, 2013 Aljabri, Trinder, Loidl (HW

418 views • 12 slides
Haskell Deian Stefan (adopted from my & Edward Yangs CSE242 slides) Why Haskell? The

Haskell Deian Stefan (adopted from my & Edward Yangs CSE242 slides) Why Haskell? The

Haskell Deian Stefan (adopted from my & Edward Yangs CSE242 slides) Why Haskell? The great ideas [Haskell] Expressive power (say more with less) Pattern matching First-class functions Exception handling Type inference Continuations

597 views • 26 slides
An Introduction to CDC Information and Resources for Translation and Implementation in Genomic

An Introduction to CDC Information and Resources for Translation and Implementation in Genomic

Division of Public Health Information Dissemination Center for Surveillance, Epidemiology, and Laboratory Services An Introduction to CDC Information and Resources for Translation and Implementation in Genomic Medicine to Improve the Publics

761 views • 37 slides
PROGR OGRAMMING NG IN N HA HASKE KELL LL Chapter 2 - First Steps 0 Glasgow Haskell

PROGR OGRAMMING NG IN N HA HASKE KELL LL Chapter 2 - First Steps 0 Glasgow Haskell

PROGR OGRAMMING NG IN N HA HASKE KELL LL Chapter 2 - First Steps 0 Glasgow Haskell Compiler GHC is the leading implementation of Haskell, and comprises a compiler and interpreter; The interactive nature of the interpreter makes it

403 views • 23 slides
DESIGN OF PRAGMATIC TRIALS Ana Quiones, PhD & Jonathan Jackson, PhD April 16, 2020

DESIGN OF PRAGMATIC TRIALS Ana Quiones, PhD & Jonathan Jackson, PhD April 16, 2020

National Institute on Aging (NIA) IMbedded Pragmatic Alzheimers Disease (AD) and AD-Related Dementias (AD/ADRD) Clinical Trials (IMPACT) Collaboratory (NIA U54AG063546) HEALTH EQUITY AS FOUNDATIONAL TO THE DESIGN OF PRAGMATIC TRIALS Ana

642 views • 31 slides
Cashew-Nuts in Haskell Implementation of a Timed Process Calculus Simon Foster University of

Cashew-Nuts in Haskell Implementation of a Timed Process Calculus Simon Foster University of

Cashew-Nuts in Haskell Implementation of a Timed Process Calculus Simon Foster University of Sheffield November 25, 2005 Simon Foster (University of Sheffield) Cashew-Nuts in Haskell November 25, 2005 1 / 75 Outline 1 Introduction Overview

930 views • 75 slides
Avoiding Loss in Translation: From Evidence-Based Practice to Implementation Science for

Avoiding Loss in Translation: From Evidence-Based Practice to Implementation Science for

Avoiding Loss in Translation: From Evidence-Based Practice to Implementation Science for Individuals with ASD Samuel L. Odom FPG Child Development Institute University of North Carolina Goals of the Presentation Describe the origins of

1.02k views • 70 slides
Genomics in the Kidney Clinic Translation, Implementation and Challenges Dr Andrew Mallett

Genomics in the Kidney Clinic Translation, Implementation and Challenges Dr Andrew Mallett

Genomics in the Kidney Clinic Translation, Implementation and Challenges Dr Andrew Mallett Nephrologist, RBWH & MNHHS National Director, KidGen AGHA Renal Genetics Flagship Why Kidneys? Frequency, Outcomes and the Nephron 1 in 8 Australian

606 views • 21 slides
Through the lens of Haskell Exploring new ideas for library design @georgesdubus Haskell, the

Through the lens of Haskell Exploring new ideas for library design @georgesdubus Haskell, the

Through the lens of Haskell Exploring new ideas for library design @georgesdubus Haskell, the language Haskell, the ecosystem Design space There should be one and preferably only one obvious way to do it. (Python) There should be

831 views • 46 slides
Pragmatic Evolution of Super 6 and Sky Bet for Resiliency M i c h a e l M a i b a u m S k y B

Pragmatic Evolution of Super 6 and Sky Bet for Resiliency M i c h a e l M a i b a u m S k y B

Pragmatic Evolution of Super 6 and Sky Bet for Resiliency M i c h a e l M a i b a u m S k y B e t t i n g & G a m i n g @ m m a i b a u m Pragmatic and Achievable Focus is on pragmatic, achievable improvements in availability

824 views • 47 slides
Deriving a Relationship from a Single Example Neil Mitchell community.haskell.org/~ndm/derive

Deriving a Relationship from a Single Example Neil Mitchell community.haskell.org/~ndm/derive

Deriving a Relationship from a Single Example Neil Mitchell community.haskell.org/~ndm/derive Haskell data type Haskell lets us define data types: data Language = Haskell [Extension] Compiler | Javascript | Cpp Version Eq instance

1.46k views • 56 slides
Metaprogramming Haskell, Metaprogramming Haskell, Metaprogramming Haskell, The Racket Way The

Metaprogramming Haskell, Metaprogramming Haskell, Metaprogramming Haskell, The Racket Way The

Metaprogramming Haskell, Metaprogramming Haskell, Metaprogramming Haskell, The Racket Way The Racket Way The Racket Way Alexis King Alexis King Northwestern University & PLT 1 #!/bin/bash set -ueo pipefail curl -s

1.4k views • 70 slides
Haskell for Grownups Bill Harrison February 8, 2019 Table of Contents Introduction Resources

Haskell for Grownups Bill Harrison February 8, 2019 Table of Contents Introduction Resources

Haskell for Grownups Bill Harrison February 8, 2019 Table of Contents Introduction Resources for Haskell Haskell vs. C Types + Functions = Programs Pragmatics Modules are the basic unit of a Haskell program Using GHCi How to Write a

761 views • 50 slides

More recommend