-
221
-
222
Key Factors Determining the Behavior of Pathogens in Dry-Cured Ham after High Pressure Processing
Published 2022-12-01Get full text
Article -
223
-
224
A reflection−based proof tactic for lattices in Coq
Published 2009“…We will paint the essence of the approach in broad strokes and discuss the use of certified functional programs to aid the automation of formal reasoning.…”
Book -
225
Zinc Protoporphyrin-Rich Pork Liver Homogenates as Coloring Ingredients in Nitrite-Free Liver Pâtés
Published 2024-02-01Get full text
Article -
226
Alterations of NK Cell Phenotype in the Disease Course of Multiple Myeloma
Published 2021-01-01Get full text
Article -
227
-
228
Formal Derivation of a Pattern Matching Algorithm
Published 1989“…The novel aspects of the present treatment are: (i) the result is expressed as a (very short) functional program; and (ii) the derivation makes use of the calculus of lists described by Bird.…”
Journal article -
229
IO vs OI in Higher-Order Recursion Schemes
Published 2012-02-01“…Given that higher-order recursion schemes can be used as a model of functional programs, innermost-outermost derivations policy represents a theoretical view point of call by value evaluation strategy.…”
Get full text
Article -
230
VerSum: Verifiable Computations over Large Public Logs
Published 2015“…VerSum's contribution lies in achieving low server-side overhead for both incremental re-computation and conflict resolution, using three key ideas: (1) representing the computation as a functional program, which allows memoization of previous results; (2) recording the evaluation trace of the functional program in a carefully designed computation history to help clients determine which server made a mistake; and (3) introducing a new authenticated data structure for sequences, called SeqHash, that makes it efficient for servers to construct summaries of computation histories in the presence of incremental re-computation. …”
Get full text
Get full text
Get full text
Get full text
Article -
231
Foundational Integration Verification of a Cryptographic Server
Published 2024“…Connecting these components is a minimalistic specification style based on functional programs and assertions over simple objects, omnisemantics for program execution, and basic separation logic for memory layout. …”
Get full text
Article -
232
Polygraphic programs and polynomial-time functions
Published 2009-06-01“…For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a Turing-complete computational model. …”
Get full text
Article -
233
-
234
Termination of canonical context-sensitive rewriting and productivity of rewrite systems
Published 2015-12-01“…Termination of programs, i.e., the absence of infinite computations, ensures the existence of normal forms for all initial expressions, thus providing an essential ingredient for the definition of a normalization semantics for functional programs. In lazy functional languages, though, infinite data structures are often delivered as the outcome of computations. …”
Get full text
Article -
235
Relational compilation: Functional-to-imperative code generation for performance-critical applications
Published 2022“…Purely functional programs verified using interactive theorem provers typically need to be translated to run: either by extracting them to a similar language (like Coq to OCaml) or by proving them equivalent to deeply embedded implementations (like C programs). …”
Get full text
Get full text
Thesis -
236
Housing and the Pandemic: How Has Covid-19 Influenced Residents’ Needs and Aspirations?
Published 2023-06-01“…The Covid-19 pandemic, which humankind had been experiencing for two years, influenced all spheres of human life, especially inhabitation. The functional program of homes has changed, as well as public spaces, transportation and social ties. …”
Get full text
Article -
237
A Light Modality for Recursion
Published 2019-02-01“…We investigate the interplay between a modality for controlling the behaviour of recursive functional programs on infinite structures which are completely silent in the syntax. …”
Get full text
Article -
238
Theory and Practice of Fusion
Published 2010“…There are a number of approaches for eliminating intermediate data structures in functional programs—this elimination is commonly known as fusion. …”
Conference item -
239
Theory and Practice of Fusion
Published 2011“…There are a number of approaches for eliminating intermediate data structures in functional programs - this elimination is commonly known as fusion. …”
Conference item -
240
Theory and Practice of Fusion
Published 2011“…There are a number of approaches for eliminating intermediate data structures in functional programs—this elimination is commonly known as fusion. …”
Book