Lazy Evaluation: From natural semantics to a machine-checked compiler transformation

In order to solve a long-standing problem with list fusion, a new compiler transformation, “Call Arity” is developed and implemented in the Haskell compiler GHC. It is formally proven to not degrade program performance; the proof is machine-checked using the interactive theorem prover Isabelle. To t...

Ful tanımlama

Detaylı Bibliyografya

Yazar:	Breitner, Joachim
Materyal Türü:	Online
Dil:	İngilizce
Baskı/Yayın Bilgisi:	KIT Scientific Publishing 2021
Konular:	QA75.5-76.95 Funktionale Programmierung Formale Verifikation Semantik Isabelle HaskellFunctional Programming Semantics Formal Verification Haskell Isabelle bic Book Industry Communication::U Computing & information technology::UY Computer science
Online Erişim:	34320
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!