ts.data61.csiro.au
Summer Scholarships | TS | Data61
http://ts.data61.csiro.au/students/summer.pml
Skip to main content. Trustworthy Systems @ Data61. Taste of Research (ToR) 2016-2017 Summer Project Proposals. Applications for summer research in Trustworthy Systems for the topics below can be made through. UNSW Faculty of Engineering Taste of Research Scholarships. Program (closes August 2016). University of Sydney Summer Scholarships. Program (closes September 2016). Automating Formal Proofs ( USyd). The aim of this project is to investigate useful applications for Eisbach, with several possible dom...
github.com
GitHub - CakeML/cakeml: CakeML: A Verified Implementation of ML
https://github.com/CakeML/cakeml
CakeML: A Verified Implementation of ML. Use Git or checkout with SVN using the web URL. Bbt hol light assums. Aug 21, 2016. Increase regression test timeout to 12 hours. Failed to load latest commit information. Xsimpl] now simplifies [IO ns] if ns is the same on both sides. Aug 8, 2016. Fix ml monadProg (after. Aug 13, 2016. Add compset for ml progLib, fix CF's xmatch. Aug 20, 2016. Fix I/O example and make it a bit more robust. Aug 20, 2016. Increase regression test timeout to 12 hours. Aug 21, 2016.
en.wikipedia.org
Standard ML - Wikipedia, the free encyclopedia
https://en.wikipedia.org/wiki/Standard_ML
From Wikipedia, the free encyclopedia. Is a general-purpose, modular. With compile-time type checking. It is popular among compiler. Writers and programming language researchers. As well as in the development of theorem provers. SML is a modern descendant of the ML programming language. Used in the Logic for Computable Functions. LCF) theorem-proving project. It is distinctive among widely used languages in that it has a formal specification, given as typing rules. In The Definition of Standard ML. Is on...
cl.cam.ac.uk
Lem
https://www.cl.cam.ac.uk/~pes20/lem
Lem, a tool for lightweight executable mathematics. Lem is a lightweight tool for writing, managing, and publishing large scale semantic definitions. It is also intended as an intermediate language for generating definitions from domain-specific tools, and for porting definitions between interactive theorem proving systems (such as Coq, HOL4, and Isabelle). Lem typechecks its input and can generate executable OCaml, theorem prover definitions in Coq. Lem: reusable engineering of real-world semantics.
technotes-djg.blogspot.com
TechNotes-DJG: TNDJG:0004: I converted my processor design to Bluespec and it went more than twice as fast!
http://technotes-djg.blogspot.com/2013/08/tndjg0004-i-converted-my-processor.html
Tuesday, 27 August 2013. TNDJG:0004: I converted my processor design to Bluespec and it went more than twice as fast! The Cake ML Project, https:/ cakeml.org/,. Is developing a fully-verified ML system that includes the hardware, run-time system and compiler. An important hardware component is the processor that executes the bytecode. Overview block diagram of the system:. My Verilog implementation was 600 lines long (the module HWML CPU CORE in cpucore0.zip). Both implementations were written fairly qui...
technotes-djg.blogspot.com
TechNotes-DJG: August 2013
http://technotes-djg.blogspot.com/2013_08_01_archive.html
Tuesday, 27 August 2013. TNDJG:0004: I converted my processor design to Bluespec and it went more than twice as fast! The Cake ML Project, https:/ cakeml.org/,. Is developing a fully-verified ML system that includes the hardware, run-time system and compiler. An important hardware component is the processor that executes the bytecode. Overview block diagram of the system:. My Verilog implementation was 600 lines long (the module HWML CPU CORE in cpucore0.zip). Both implementations were written fairly qui...
hol-theorem-prover.org
Release notes for HOL4, Kananaskis-10
https://hol-theorem-prover.org/kananaskis-10.release.html
Release notes for HOL4, Kananaskis-10. We are pleased to announce the Kananaskis-10 release of HOL 4. Manuals are now available in Italian translations. Work on the. Manual is also far advanced. Many, many thanks to Domenico Masini for doing this work. The abbreviation tactics (. And others) now handle abstractions as abbreviations better. In particular, if one sets up an abstraction as an abbreviation (. QABBREV TAC `f = (λn. 2 * n 10)`. Above, the simplifier would turn a goal such as. 2 * (z 1) 10 100.
pldi17.sigplan.org
Program - PLDI 2017
http://pldi17.sigplan.org/program/program-pldi-2017
Sun 18 - Fri 23 June 2017 Barcelona, Spain. Co-located with PLDI'17 and ECOOP'17. Venue: Universitat Politècnica de Catalunya. PLDI'17 and ECOOP'17 Program. Sun 18 Jun 2017. Tutorials June 18 Morning A. Tutorials June 18 Afternoon A. Mon 19 Jun 2017. Tue 20 Jun 2017. Wed 21 Jun 2017. Thu 22 Jun 2017. Tutorials June 22 Morning A. Tutorials June 22 Afternoon A. Tutorials June 22 Full D. Tutorials June 22 Morning E. Fri 23 Jun 2017. Tutorials June 23 Morning A. Tutorials June 23 Full D. Magnus O. Myreen.
pldi17.sigplan.org
PLDI 2017 Tutorials - PLDI 2017
http://pldi17.sigplan.org/track/pldi-2017-workshops-and-tutorials
Sun 18 - Fri 23 June 2017 Barcelona, Spain. Co-located with PLDI'17 and ECOOP'17. Venue: Universitat Politècnica de Catalunya. PLDI hosts multiple tutorials on diverse subjects related to compilation and programming language design. Click on the events below for more information. Bug detection in JavaScript web apps using the SAFE framework. Building your own modular static analyzer with Facebook Infer. Engineering Static Analyzers with Soufflé. Graal: High Performance Compilation for Managed Languages.
