Filters








169 Hits in 4.4 sec

Politeness for the Theory of Algebraic Datatypes [article]

Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett
2020 arXiv   pre-print
Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers.  ...  Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT).  ...  We are thankful to the anonymous reviewers for their comments.  ... 
arXiv:2004.04854v3 fatcat:qa42nd2o4jdnhoiptfn25anlem

Politeness for the Theory of Algebraic Datatypes [chapter]

Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett
2020 Lecture Notes in Computer Science  
Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers.  ...  Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT).  ...  We are thankful to the anonymous reviewers for their comments.  ... 
doi:10.1007/978-3-030-51074-9_14 fatcat:zhlv4rrbmvcmbor7lomwbc2nfy

Politeness for the Theory of Algebraic Datatypes (Extended Abstract)

Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett
2021 Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence   unpublished
Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers.  ...  Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT).  ...  Datatypes and Politeness The Theory of Datatypes We use the definition of the theory of algebraic datatypes as it appears in the SMT-LIB 2 standard .  ... 
doi:10.24963/ijcai.2021/660 fatcat:cgsgc7q32bd7jdftnlstsjpljy

Politeness and Stable Infiniteness: Stronger Together [article]

Ying Sheng, Yoni Zohar, Christophe Ringeissen, Andrew Reynolds, Clark Barrett, Cesare Tinelli
2021 arXiv   pre-print
We make two contributions to the study of polite combination in satisfiability modulo theories.  ...  The first contribution is a separation between politeness and strong politeness, by presenting a polite theory that is not strongly polite.  ...  The strong politeness of the theory of algebraic datatypes [5] was proven in [19] .  ... 
arXiv:2104.11738v2 fatcat:ap3spcb6nbc4vk7lkqbvwctnku

Dependency-style generic haskell

Andres Löh, Dave Clarke, Johan Jeuring
2003 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming - ICFP '03  
These foundations consist of a full type system for Dependency-style Generic Haskell's core language and appropriate reduction rules.  ...  Generic Haskell is an extension of Haskell that supports the construction of generic programs.  ...  Much of this work stems from so-called theories of datatypes, for example [3] , which are often based on category theoretic notions such as initial algebras.  ... 
doi:10.1145/944705.944719 dblp:conf/icfp/LohCJ03 fatcat:ygf3s7a6fvboffflgvxgsoqn2a

Dependency-style generic haskell

Andres Löh, Dave Clarke, Johan Jeuring
2003 SIGPLAN notices  
These foundations consist of a full type system for Dependency-style Generic Haskell's core language and appropriate reduction rules.  ...  Generic Haskell is an extension of Haskell that supports the construction of generic programs.  ...  Much of this work stems from so-called theories of datatypes, for example [3] , which are often based on category theoretic notions such as initial algebras.  ... 
doi:10.1145/944746.944719 fatcat:uagm5fsk3bgfbn27wrguz7ppwe

Modeling and Verification of Insider Threats Using Logical Analysis

Florian Kammuller, Christian W. Probst
2017 IEEE Systems Journal  
Another example is Motivation. datatype motivations = financial | political | revenge | fun | competitive_advantage | power | peer_recognition A practical issue is the integration of causalities, quantification  ...  We use here the concept of a HOL datatype.  ... 
doi:10.1109/jsyst.2015.2453215 fatcat:j4lll4qrgrb2bhqrm3ppon6esi

A functional approach to automatic melody harmonisation

Hendrik Vincent Koops, José Pedro Magalhães, W. Bas de Haas
2013 Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design - FARM '13  
In one experiment, a panel of harmony experts is asked to give its professional opinion and rate the generated chord sequences for selected melodies.  ...  In this work we describe FHARM, an automated system for melody harmonisation based on a functional model of harmony.  ...  Acknowledgments The readers of Koops (2012, upon  ... 
doi:10.1145/2505341.2505343 dblp:conf/icfp/KoopsMH13 fatcat:j2bpiz73azayjeoa2cvwyt4t64

A relation-algebraic approach to simple games

Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinowska, Harrie de Swart
2011 European Journal of Operational Research  
In this paper, we present relation-algebraic models of simple games and develop relational specifications for solving some basic problems of them.  ...  This leads to relation-algebraic specifications, which can be evaluated with the help of the BDD-based tool RelView after a simple translation into the tool's programming language.  ...  Since winning seems to be the essence of politics, simple games are extremely suitable for analyzing political situations.  ... 
doi:10.1016/j.ejor.2010.09.006 fatcat:noki2m4burcoplh6q5ahstofeq

A Relation-Algebraic Approach to Simple Games

Rudolf Berghammer, Agnieszka Rusinowska, Harrie De Swart
2009 Social Science Research Network  
In this paper, we present relation-algebraic models of simple games and develop relational specifications for solving some basic problems of them.  ...  This leads to relation-algebraic specifications, which can be evaluated with the help of the BDD-based tool RelView after a simple translation into the tool's programming language.  ...  Since winning seems to be the essence of politics, simple games are extremely suitable for analyzing political situations.  ... 
doi:10.2139/ssrn.1436975 fatcat:ikh5zi3slbg25hkoopych6b4q4

The BAGEL assembler generation library

Peter A. Boyle
2009 Computer Physics Communications  
The code includes a complete conjugate gradient implementation for the Wilson and Domain Wall fermion actions, making it easy to use for third party codes including the Jefferson Laboratory's CHROMA, UKQCD's  ...  The Bagel library can generate assembly code for a number of architectures and is configurable -supporting several precision and memory pattern options to allow architecture specifig optimisation.  ...  The problem of solving the theory is amenable only to computer simulation.  ... 
doi:10.1016/j.cpc.2009.08.010 fatcat:vg6w2krmmfglzls5qplqbvftlu

Programming from Metaphorisms [article]

J.N. Oliveira
2017 arXiv   pre-print
By framing metaphorisms in the class of (inductive) regular relations, sufficient conditions are given for such implementations to be calculated using relation algebra.  ...  The strategy is illustrated with examples including the derivation of the quicksort and mergesort algorithms, showing what they have in common and what makes them different from the very start of development  ...  Acknowledgements The origin of this paper is not computer science.  ... 
arXiv:1709.09013v1 fatcat:yvtlyvboercsxkgz5o4trbmn3e

Definability with the State Operator in Process Algebra [chapter]

Javier Blanco
1995 Workshops in Computing  
Even when both theories are restricted to algebraic theories, some different combinations were used.  ...  The theory of process algebras with a NIL process was developed in [Mol89, BV89] . The signature will be the same as for ACP with the exception that 5 will be replaced by NIL.  ...  Stellingen behorende bij bet proefscluift The State Operator One of the advantages of process algebra that is often cited (for example [BW90] ) is the ability to obtain results that a.re independent of  ... 
doi:10.1007/978-1-4471-2120-6_9 fatcat:gr6p4smegjgyzj7oedei4pjmlu

Wherefore Art Thou $$\ldots $$ Semantics of Computation? [chapter]

Furio Honsell
2016 IFIP Advances in Information and Communication Technology  
We analyse philosophical issues revolving around the Foundations of Formal Reasoning, Proof Cultures, Logical Frameworks, the Algebraic/Co-algebraic Duality, and Games.  ...  There was quite some divergence of opinions, at the time, in what the semantics of semantics was supposed to be.  ...  I hope that this paper might have a socratic effect in calling for more attempts at understanding what we mean by Semantics of Computation, or at least in soliciting alternative narratives of its triumphal  ... 
doi:10.1007/978-3-319-47286-7_1 fatcat:kgebrsc45vcz5n3nilqs3zy7y4

Modelling Value-oriented Legal Reasoning in LogiKEy [article]

Christoph Benzmüller and David Fuenmayor and Bertram Lomfeld
2022 arXiv   pre-print
, illustrating how LogiKEy can harness interactive and automated theorem proving technology to provide a testbed for the development and formal verification of legal domain-specific languages and theories  ...  The logico-pluralist LogiKEy knowledge engineering methodology and framework is applied to the modelling of a theory of legal balancing in which legal knowledge (cases and laws) is encoded by utilising  ...  Acknowledgements We thank the unknown reviewers of our prior paper at the MLR 2020 workshop for their valuable comments and suggestions that have led to significant improvements of this article.  ... 
arXiv:2006.12789v5 fatcat:5hmrok7ls5c6riplcn3v5gvb34
« Previous Showing results 1 — 15 out of 169 results