A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains (Q5179011): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q113318277, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of functions into logic programming: From theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order narrowing with definitional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generic scheme for functional logic programming with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle. A generic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees / rank
 
Normal rank

Latest revision as of 20:05, 9 July 2024

scientific article; zbMATH DE number 6416656
Language Label Description Also known as
English
A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
scientific article; zbMATH DE number 6416656

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references