Jacques Carette
YOU?
Author Swipe
View article: The Agda standard library: version 2.0
The Agda standard library: version 2.0 Open
Version 2.0 of the Agda Standard Library - uploaded for publication in the Journal of Open Source Software
View article: The Agda standard library: version 2.0
The Agda standard library: version 2.0 Open
Version 2.0 of the Agda Standard Library - uploaded for publication in the Journal of Open Source Software
View article: P-729 Cost-effectiveness of follitropin delta versus follitropin alfa for controlled ovarian stimulation for IVF/ICSI in China
P-729 Cost-effectiveness of follitropin delta versus follitropin alfa for controlled ovarian stimulation for IVF/ICSI in China Open
Study question Is follitropin delta cost-effective compared with follitropin alfa for controlled ovarian stimulation (COS) for IVF/ICSI in China? Summary answer Follotropin delta leads to higher live birth rates at lower costs compared wit…
View article: How to Bake a Quantum Π
How to Bake a Quantum Π Open
We construct a computationally universal quantum programming language Quantum Π from two copies of Π, the internal language of rig groupoids. The first step constructs a pure (measurement-free) term language by interpreting each copy of Π …
View article: State of the Practice for Medical Imaging Software
State of the Practice for Medical Imaging Software Open
We selected 29 medical imaging projects from 48 candidates, assessed 10 software qualities by answering 108 questions for each software project, and interviewed 8 of the 29 development teams. Based on the quantitative data, we ranked the M…
View article: With a Few Square Roots, Quantum Computing Is as Easy as Pi
With a Few Square Roots, Quantum Computing Is as Easy as Pi Open
Rig groupoids provide a semantic model of , a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps and three equations about them results in a model of quantum co…
View article: With a Few Square Roots, Quantum Computing is as Easy as Π
With a Few Square Roots, Quantum Computing is as Easy as Π Open
Rig groupoids provide a semantic model of \PiLang, a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps and three equations about them results in a model of quant…
View article: The Quantum Effect: A Recipe for QuantumPi
The Quantum Effect: A Recipe for QuantumPi Open
Free categorical constructions characterise quantum computing as the combination of two copies of a reversible classical model, glued by the complementarity equations of classical structures. This recipe effectively constructs a computatio…
View article: Generating Software for Well-Understood Domains
Generating Software for Well-Understood Domains Open
Current software development is often quite code-centric and aimed at short-term deliverables, due to various contextual forces (such as the need for new revenue streams from many individual buyers). We're interested in software where diff…
View article: Symbolic Execution of Hadamard-Toffoli Quantum Circuits
Symbolic Execution of Hadamard-Toffoli Quantum Circuits Open
The simulation of quantum programs by classical computers is a critical endeavor for several reasons: it provides proof-of-concept validation of quantum algorithms; it provides opportunities to experiment with new programming abstractions …
View article: What Lies Beneath—A Survey of Affective Theory Use in Computational Models of Emotion
What Lies Beneath—A Survey of Affective Theory Use in Computational Models of Emotion Open
Studying and developing systems that can recognize, express, and “have” emotions is called affective computing. To create a Computational Models of Emotion (CMEs), one must first identify what kind of system to build, then find emotion the…
View article: Retrodictive Quantum Computing
Retrodictive Quantum Computing Open
Quantum models of computation are widely believed to be more powerful than classical ones. Efforts center on proving that, for a given problem, quantum algorithms are more resource efficient than any classical one. All this, however, assum…
View article: Retrodictive Quantum Computing
Retrodictive Quantum Computing Open
Quantum evolution is time-reversible and yet little advantage is gained from this in the circuit model of quantum computing. Indeed, most quantum algorithms expressed in the circuit model compute strictly from the present to the future, pr…
View article: What Lies Beneath—A Survey of Affective Theory Use in Computational Models of Emotion
What Lies Beneath—A Survey of Affective Theory Use in Computational Models of Emotion Open
Studying and developing systems that can recognize, express, and “have” emotions is called affective computing. To create a Computational Models of Emotion (CMEs), one must first identify what kind of system to build, then find emotion the…
View article: What Lies Beneath - A Survey of Affective Theory Use in Computational Models of Emotion
What Lies Beneath - A Survey of Affective Theory Use in Computational Models of Emotion Open
Affective computing encompasses the research and development of systems that can recognize, express, and ``have'' emotions. Its literature is already vast, which is a hindrance for newcomers. Those who wish to create Computational Models o…
View article: Long-Term Productivity Based on Science, not Preference
Long-Term Productivity Based on Science, not Preference Open
This position paper argues that decisions on processes, tools, techniques and software artifacts (such as user manuals, unit tests, design documents and code) for scientific software development should be driven by science, not by personal…
View article: A Machine-checked proof of Birkhoff's Variety Theorem in Martin-L\"of Type Theory.
A Machine-checked proof of Birkhoff's Variety Theorem in Martin-L\"of Type Theory. Open
The Agda Universal Algebra Library (agda-algebras) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and pro…
View article: Methodology for Assessing the State of the Practice for Domain X
Methodology for Assessing the State of the Practice for Domain X Open
To improve software development methods and tools for research software, we first need to understand the current state of the practice. Therefore, we have developed a methodology for assessing the state of the software development practice…
View article: JacquesCarette/Drasil: Release to get DOI
JacquesCarette/Drasil: Release to get DOI Open
First release of prototype software, mostly to get a stable snapshot.
View article: A Machine-checked proof of Birkhoff's Variety Theorem in Martin-Löf Type Theory
A Machine-checked proof of Birkhoff's Variety Theorem in Martin-Löf Type Theory Open
The Agda Universal Algebra Library (agda-algebras) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and pro…
View article: Formalizing category theory in Agda
Formalizing category theory in Agda Open
The generality and pervasiness of category theory in modern mathematics makes\nit a frequent and useful target of formalization. It is however quite\nchallenging to formalize, for a variety of reasons. Agda currently (i.e. in\n2020) does n…
View article: Long-term Productivity for Long-term Impact
Long-term Productivity for Long-term Impact Open
We present a new conceptual definition of 'productivity' for sustainably developing research software. Existing definitions are flawed as they are short-term biased, thus devaluing long-term impact, which we consider to be the principal go…
View article: Leveraging the Information Contained in Theory Presentations
Leveraging the Information Contained in Theory Presentations Open
A theorem prover without an extensive library is much less useful to its potential users. Algebra, the study of algebraic structures, is a core component of such libraries. Algebraic theories also are themselves structured, the study of wh…
View article: Proof-relevant Category Theory in Agda.
Proof-relevant Category Theory in Agda. Open
The generality and pervasiness of category theory in modern mathematics makes it a frequent and useful target of formalization. It is however quite challenging to formalize, for a variety of reasons. Agda currently (i.e. in 2020) does not …