Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Towards Assertion-based Debugging of Higher-Order (C)LP Programs (1405.7898v2)

Published 14 May 2014 in cs.PL

Abstract: Higher-order constructs extend the expressiveness of first-order (Constraint) Logic Programming ((C)LP) both syntactically and semantically. At the same time assertions have been in use for some time in (C)LP systems helping programmers detect errors and validate programs. However, these assertion-based extensions to (C)LP have not been integrated well with higher order to date. Our work contributes to filling this gap by extending the assertion-based approach to error detection and program validation to the higher-order context, within (C)LP. It is based on an extension of properties and assertions as used in (C)LP in order to be able to fully describe arguments that are predicates.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Nataliia Stulova (10 papers)
  2. Manuel V. Hermenegildo (33 papers)
  3. José F. Morales (12 papers)

Summary

We haven't generated a summary for this paper yet.