Functional and logic programming

Więcej o książce

The book encompasses a diverse range of topics in computer science, particularly focusing on knowledge representation, reasoning, and programming languages. It includes invited papers on model-based knowledge representation through Answer Set Programming and the algebraic foundations of proof assistants for intuitionistic type theory. Substructural type systems are explored for program analysis, alongside refereed papers that integrate Answer Set reasoning with constraint-solving techniques and optimize compilation of Constraint Handling Rules (CHR) with rule priorities. Key contributions include certified exact real arithmetic using co-induction and pure, declarative arithmetic relations. The text delves into dependent types, on-demand refinement, and proving properties about lists using containers. Rewriting techniques are examined, addressing termination in left-linear constructor systems and complexity analysis. The semantics and pragmatics of shortcut fusion rules and a generalization of the folding rule for Clark-Kunen semantics are also discussed. Further topics include types for hereditary head normalizing terms, a new translation for semi-classical theories, and dynamic typing. The book also covers quantitative logic programming, formalizing a constraint deductive database language, and declarative diagnosis in constraint functional-logic programming, culminating in tools like EasyCheck for generating test data.