Unification of arrays in spreadsheets with logic programming

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Unification, one of the key processes underlying logic programming (LP), provides a powerful mechanism for assembling and disassembling structures, lists in particular, by matching patterns. In recent work, we showed how spreadsheets can be enhanced by adding a visual form of LP in which lists, the fundamental structures of LP, are replaced by rectangular arrays, the fundamental structures of spreadsheets. The benefits include enhanced programmability and a way to specify high level templates for spread-sheet structures. Here, we focus on the structure of arrays, and describe the array unification algorithm underlying our current implementation. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Cox, P. T., & Nicholson, P. (2007). Unification of arrays in spreadsheets with logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4902 LNCS, pp. 100–115). https://doi.org/10.1007/978-3-540-77442-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free