Giuseppe Longo and Eugenio Moggi . A Category-theoretic characterization of functional completeness. . Theoretical Computer Science, 70 (2), 1990, pp.193-211.International audienc
ABSTRACT. Free regular and exact completions of categories with various ranks of weak limits are pre...
I give a ‘totality space ’ model for linear logic [4], de-rived by taking an abstract view of comput...
AbstractLet Ω be a commutative, unital quantale. Complete and directed complete Ω-categories are the...
AbstractFunctional languages are based on the notion of application: programs may be applied to data...
We prove a relative completeness result for a logic of functional programs extending D. Scott's LCF....
Functional systems, based on the program notion are considered in the paper aiming at the general me...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
Necessary and sufficient conditions for the functional completeness of a set F of functions with var...
National audienceIn "Logicality and Invariance" (2008), Denis Bonnay introduced a generalized notion...
We present a detailed examination of applications of category theory to functional programming lang...
AbstractIn [7], we presented a completeness theorem for proving partial correctness of programs in a...
Category theory is a branch of mathematics that is used to abstract and generalize other mathematica...
variety and quasivariety of first-order structures as generalizations of the corresponding concepts ...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
ABSTRACT. Free regular and exact completions of categories with various ranks of weak limits are pre...
I give a ‘totality space ’ model for linear logic [4], de-rived by taking an abstract view of comput...
AbstractLet Ω be a commutative, unital quantale. Complete and directed complete Ω-categories are the...
AbstractFunctional languages are based on the notion of application: programs may be applied to data...
We prove a relative completeness result for a logic of functional programs extending D. Scott's LCF....
Functional systems, based on the program notion are considered in the paper aiming at the general me...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
Necessary and sufficient conditions for the functional completeness of a set F of functions with var...
National audienceIn "Logicality and Invariance" (2008), Denis Bonnay introduced a generalized notion...
We present a detailed examination of applications of category theory to functional programming lang...
AbstractIn [7], we presented a completeness theorem for proving partial correctness of programs in a...
Category theory is a branch of mathematics that is used to abstract and generalize other mathematica...
variety and quasivariety of first-order structures as generalizations of the corresponding concepts ...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
ABSTRACT. Free regular and exact completions of categories with various ranks of weak limits are pre...
I give a ‘totality space ’ model for linear logic [4], de-rived by taking an abstract view of comput...
AbstractLet Ω be a commutative, unital quantale. Complete and directed complete Ω-categories are the...
DOI
Add to ORKG