Amanote Research

Amanote Research

  • Register
  • Sign In

Implementing Type Theory in Higher Order Constraint Logic Programming

Mathematical Structures in Computer Science- United Kingdom

doi 10.1017/s0960129518000427

Full Text

Abstract

Available in

Categories

MathematicsComputer Science Applications

Date

March 1, 2019

Authors

FERRUCCIO GUIDICLAUDIO SACERDOTI COENENRICO TASSI

Publisher

Cambridge University Press (CUP)


Related search

Mechanizing Programming Logics in Higher Order Logic

1989English

Higher-Order Type-Level Programming in Haskell

Proceedings of the ACM on Programming Languages
2019English

Integrating Answer Set Programming and Constraint Logic Programming

Annals of Mathematics and Artificial Intelligence
Applied MathematicsArtificial Intelligence
2008English

Tree Drawing Using Constraint Logic Programming

1997English

Higher-Order Logic

1998English

Implementing Finite-Domain Constraint Logic Programming on Top of a PROLOG-system With Delay-Mechanism

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Functional Test Generation Using Constraint Logic Programming

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2002English

An Active-Constraint Logic for Non-Linear Programming

Optimal Control Applications and Methods
ControlSystems EngineeringApplied MathematicsOptimizationSoftware
1984English

Higher-Order Chemical Programming Style

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy