Salvato in:
Dettagli Bibliografici
Autori principali: Zhou, Neng-Fa, Grozea, Cristian, Kjellerstrand, Håkan, Mac Fhearaí, Oisín
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:https://arxiv.org/abs/2507.11731
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914237043965952
author Zhou, Neng-Fa
Grozea, Cristian
Kjellerstrand, Håkan
Mac Fhearaí, Oisín
author_facet Zhou, Neng-Fa
Grozea, Cristian
Kjellerstrand, Håkan
Mac Fhearaí, Oisín
contents Picat is a logic-based, multi-paradigm programming language that integrates features from logic, functional, constraint, and imperative programming paradigms. This paper presents solutions to several problems from the 2024 Advent of Code (AoC). While AoC problems are not designed for any specific programming language, certain problem types, such as reverse engineering and path-finding, are particularly well-suited to Picat due to its built-in constraint solving, pattern matching, backtracking, and dynamic programming with tabling. This paper demonstrates that Picat's features, especially its SAT-based constraint solving and tabling, enable concise, declarative, and highly efficient implementations of problems that would require significantly more effort in imperative languages.
format Preprint
id arxiv_https___arxiv_org_abs_2507_11731
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Picat Through the Lens of Advent of Code
Zhou, Neng-Fa
Grozea, Cristian
Kjellerstrand, Håkan
Mac Fhearaí, Oisín
Programming Languages
Picat is a logic-based, multi-paradigm programming language that integrates features from logic, functional, constraint, and imperative programming paradigms. This paper presents solutions to several problems from the 2024 Advent of Code (AoC). While AoC problems are not designed for any specific programming language, certain problem types, such as reverse engineering and path-finding, are particularly well-suited to Picat due to its built-in constraint solving, pattern matching, backtracking, and dynamic programming with tabling. This paper demonstrates that Picat's features, especially its SAT-based constraint solving and tabling, enable concise, declarative, and highly efficient implementations of problems that would require significantly more effort in imperative languages.
title Picat Through the Lens of Advent of Code
topic Programming Languages
url https://arxiv.org/abs/2507.11731