Partition Congruences by the Localization Method
Project Lead
Project Duration
01/03/2021 - 28/02/2023
Partners
The Austrian Science Fund (FWF)
Publications
2021
[Ablinger]
Extensions of the AZ-algorithm and the Package MultiIntegrate
J. Ablinger
Technical report no. 21-02 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2021. [pdf]@techreport{RISC6272,
author = {J. Ablinger},
title = {{Extensions of the AZ-algorithm and the Package MultiIntegrate}},
language = {english},
number = {21-02},
year = {2021},
length = {25},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
author = {J. Ablinger},
title = {{Extensions of the AZ-algorithm and the Package MultiIntegrate}},
language = {english},
number = {21-02},
year = {2021},
length = {25},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
[Dundua]
Variadic equational matching in associative and commutative theories
Besik Dundua, Temur Kutsia, Mircea Marin
Journal of Symbolic Computation 106, pp. 78-109. 2021. Elsevier, ISSN 0747-7171. [url] [pdf]@article{RISC6260,
author = {Besik Dundua and Temur Kutsia and Mircea Marin},
title = {{Variadic equational matching in associative and commutative theories}},
language = {english},
journal = {Journal of Symbolic Computation},
volume = {106},
pages = {78--109},
publisher = {Elsevier},
isbn_issn = {ISSN 0747-7171},
year = {2021},
refereed = {yes},
length = {32},
url = {https://doi.org/10.1016/j.jsc.2021.01.001}
}
author = {Besik Dundua and Temur Kutsia and Mircea Marin},
title = {{Variadic equational matching in associative and commutative theories}},
language = {english},
journal = {Journal of Symbolic Computation},
volume = {106},
pages = {78--109},
publisher = {Elsevier},
isbn_issn = {ISSN 0747-7171},
year = {2021},
refereed = {yes},
length = {32},
url = {https://doi.org/10.1016/j.jsc.2021.01.001}
}
[Grasegger]
Combinatorics of Bricard's octahedra
M. Gallet, G. Grasegger, J. Legerský, J. Schicho
Comptes Rendus. Mathématique 359(1), pp. 7-38. 2021. Académie des sciences, Paris, ISSN 1631-073X. [url]@article{RISC6288,
author = {M. Gallet and G. Grasegger and J. Legerský and J. Schicho},
title = {{Combinatorics of Bricard's octahedra}},
language = {english},
journal = {Comptes Rendus. Mathématique},
volume = {359},
number = {1},
pages = {7--38},
publisher = {Académie des sciences, Paris},
isbn_issn = {ISSN 1631-073X},
year = {2021},
refereed = {yes},
length = {32},
url = {https://doi.org/10.5802/crmath.132}
}
author = {M. Gallet and G. Grasegger and J. Legerský and J. Schicho},
title = {{Combinatorics of Bricard's octahedra}},
language = {english},
journal = {Comptes Rendus. Mathématique},
volume = {359},
number = {1},
pages = {7--38},
publisher = {Académie des sciences, Paris},
isbn_issn = {ISSN 1631-073X},
year = {2021},
refereed = {yes},
length = {32},
url = {https://doi.org/10.5802/crmath.132}
}
[Grasegger]
On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere
M. Gallet, G. Grasegger, J. Legerský, J. Schicho
SIAM Journal on Discrete Mathematics 35(1), pp. 325-361. 2021. ISSN 0895-4801. [url]@article{RISC6290,
author = {M. Gallet and G. Grasegger and J. Legerský and J. Schicho},
title = {{On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere}},
language = {english},
journal = {SIAM Journal on Discrete Mathematics},
volume = {35},
number = {1},
pages = {325--361},
isbn_issn = {ISSN 0895-4801},
year = {2021},
refereed = {yes},
length = {37},
url = {https://doi.org/10.1137/19M1289467}
}
author = {M. Gallet and G. Grasegger and J. Legerský and J. Schicho},
title = {{On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere}},
language = {english},
journal = {SIAM Journal on Discrete Mathematics},
volume = {35},
number = {1},
pages = {325--361},
isbn_issn = {ISSN 0895-4801},
year = {2021},
refereed = {yes},
length = {37},
url = {https://doi.org/10.1137/19M1289467}
}
[Jebelean]
A Heuristic Prover for Elementary Analysis in Theorema
Tudor Jebelean
Technical report no. 21-07 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. April 2021. [pdf]@techreport{RISC6293,
author = {Tudor Jebelean},
title = {{A Heuristic Prover for Elementary Analysis in Theorema}},
language = {english},
abstract = {We present the application of certain heuristic techniques for the automation of proofs in elementary analysis. the techniques used are: the S-decomposition method for formulae with alternating quantifiers, quantifier elimination by cylindrical algebraic decomposition, analysis of terms behavior in zero, bounding the [Epsilon]-bounds, semantic simplification of expressions involving absolute value, polynomial arithmetic, usage of equal arguments to arbitrary functions, and automatic reordering of proof steps in order to check the admisibility of solutions to the metavariables. The proofs are very similar to those produced automatically, but they are edited for readability and aspect, and also for inserting the appropriate explanation about the use of the proof techniques. The proofs are: convergence of product of two sequences, continuity of the sum of two functions, uniform continuity of the sum of two functions, uniform continuity of the product of two functions, and continuity of the composition of functions.},
number = {21-07},
year = {2021},
month = {April},
length = {29},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
author = {Tudor Jebelean},
title = {{A Heuristic Prover for Elementary Analysis in Theorema}},
language = {english},
abstract = {We present the application of certain heuristic techniques for the automation of proofs in elementary analysis. the techniques used are: the S-decomposition method for formulae with alternating quantifiers, quantifier elimination by cylindrical algebraic decomposition, analysis of terms behavior in zero, bounding the [Epsilon]-bounds, semantic simplification of expressions involving absolute value, polynomial arithmetic, usage of equal arguments to arbitrary functions, and automatic reordering of proof steps in order to check the admisibility of solutions to the metavariables. The proofs are very similar to those produced automatically, but they are edited for readability and aspect, and also for inserting the appropriate explanation about the use of the proof techniques. The proofs are: convergence of product of two sequences, continuity of the sum of two functions, uniform continuity of the sum of two functions, uniform continuity of the product of two functions, and continuity of the composition of functions.},
number = {21-07},
year = {2021},
month = {April},
length = {29},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
[Legersky]
On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2
E. Bartzos, I.Z. Emiris, J. Legerský, E. Tsigaridas
Journal of Symbolic Computation 102, pp. 189-208. 2021. ISSN 0747-7171. [url]@article{RISC5992,
author = {E. Bartzos and I.Z. Emiris and J. Legerský and E. Tsigaridas},
title = {{On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2}},
language = {english},
journal = {Journal of Symbolic Computation},
volume = {102},
pages = {189--208},
isbn_issn = {ISSN 0747-7171},
year = {2021},
refereed = {yes},
length = {20},
url = {https://doi.org/10.1016/j.jsc.2019.10.015}
}
author = {E. Bartzos and I.Z. Emiris and J. Legerský and E. Tsigaridas},
title = {{On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2}},
language = {english},
journal = {Journal of Symbolic Computation},
volume = {102},
pages = {189--208},
isbn_issn = {ISSN 0747-7171},
year = {2021},
refereed = {yes},
length = {20},
url = {https://doi.org/10.1016/j.jsc.2019.10.015}
}
[Maletzky]
A generic and executable formalization of signature-based Gröbner basis algorithms
Alexander Maletzky
J. Symb. Comput. 106, pp. 23-47. 2021. Elsevier, ISSN 0747-7171. arXiv:2012.02239 [cs.SC], https://doi.org/10.1016/j.jsc.2020.12.001. [url]@article{RISC6225,
author = {Alexander Maletzky},
title = {{A generic and executable formalization of signature-based Gröbner basis algorithms}},
language = {english},
journal = {J. Symb. Comput.},
volume = {106},
pages = {23--47},
publisher = {Elsevier},
isbn_issn = {ISSN 0747-7171},
year = {2021},
note = {arXiv:2012.02239 [cs.SC], https://doi.org/10.1016/j.jsc.2020.12.001},
refereed = {yes},
length = {25},
url = {https://arxiv.org/abs/2012.02239}
}
author = {Alexander Maletzky},
title = {{A generic and executable formalization of signature-based Gröbner basis algorithms}},
language = {english},
journal = {J. Symb. Comput.},
volume = {106},
pages = {23--47},
publisher = {Elsevier},
isbn_issn = {ISSN 0747-7171},
year = {2021},
note = {arXiv:2012.02239 [cs.SC], https://doi.org/10.1016/j.jsc.2020.12.001},
refereed = {yes},
length = {25},
url = {https://arxiv.org/abs/2012.02239}
}
[Pau]
Proximity-Based Unification and Matching for Full Fuzzy Signatures
Temur Kutsia, Cleo Pau
Technical report no. 21-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2021. [pdf]@techreport{RISC6296,
author = {Temur Kutsia and Cleo Pau},
title = {{Proximity-Based Unification and Matching for Full Fuzzy Signatures}},
language = {english},
number = {21-08},
year = {2021},
length = {15},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
author = {Temur Kutsia and Cleo Pau},
title = {{Proximity-Based Unification and Matching for Full Fuzzy Signatures}},
language = {english},
number = {21-08},
year = {2021},
length = {15},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
[Pau]
Generalization Algorithms with Proximity Relations in Full Fuzzy Signatures
Temur Kutsia, Cleo Pau
Technical report no. 21-09 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2021. [pdf]@techreport{RISC6297,
author = {Temur Kutsia and Cleo Pau},
title = {{Generalization Algorithms with Proximity Relations in Full Fuzzy Signatures}},
language = {english},
number = {21-09},
year = {2021},
length = {15},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
author = {Temur Kutsia and Cleo Pau},
title = {{Generalization Algorithms with Proximity Relations in Full Fuzzy Signatures}},
language = {english},
number = {21-09},
year = {2021},
length = {15},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
[Paule]
An Invitation to Analytic Combinatorics
Peter Paule (ed.), Stephen Melczer
Texts and Monographs in Symbolic Computation 1st edition, 2021. Springer, 978-3-030-67080-1.@book{RISC6277,
author = {Peter Paule (ed.) and Stephen Melczer},
title = {{An Invitation to Analytic Combinatorics}},
language = {english},
series = {Texts and Monographs in Symbolic Computation},
publisher = {Springer},
isbn_issn = {978-3-030-67080-1},
year = {2021},
edition = {1st},
translation = {0},
length = {405}
}
author = {Peter Paule (ed.) and Stephen Melczer},
title = {{An Invitation to Analytic Combinatorics}},
language = {english},
series = {Texts and Monographs in Symbolic Computation},
publisher = {Springer},
isbn_issn = {978-3-030-67080-1},
year = {2021},
edition = {1st},
translation = {0},
length = {405}
}
[Schneider]
The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra
C. Schneider
Mathematics in Computer Science , appeared electronically, pp. ?-?. 2021. ISSN 1661-8289. arXiv:2003.01921 [math.CO]. [url]@article{RISC6127,
author = {C. Schneider},
title = {{The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra}},
language = {english},
journal = {Mathematics in Computer Science , appeared electronically},
pages = {?--?},
isbn_issn = {ISSN 1661-8289},
year = {2021},
note = {arXiv:2003.01921 [math.CO]},
refereed = {yes},
length = {12},
url = {https://doi.org/10.1007/s11786-020-00494-w}
}
author = {C. Schneider},
title = {{The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra}},
language = {english},
journal = {Mathematics in Computer Science , appeared electronically},
pages = {?--?},
isbn_issn = {ISSN 1661-8289},
year = {2021},
note = {arXiv:2003.01921 [math.CO]},
refereed = {yes},
length = {12},
url = {https://doi.org/10.1007/s11786-020-00494-w}
}
[Schneider]
Three loop heavy quark form factors and their asymptotic behavior
J. Ablinger, J. Blümlein, P. Marquard, N. Rana, C. Schneider
In: To appear in Proc.of 23rd DAE-BRNS High Energy Physics Symposium 2018, , pp. ?-?. 2021. arXiv:1906.05829 [hep-ph]. [url]@inproceedings{RISC6024,
author = {J. Ablinger and J. Blümlein and P. Marquard and N. Rana and C. Schneider},
title = {{Three loop heavy quark form factors and their asymptotic behavior}},
booktitle = {{To appear in Proc.of 23rd DAE-BRNS High Energy Physics Symposium 2018}},
language = {english},
pages = {?--?},
isbn_issn = {?},
year = {2021},
note = {arXiv:1906.05829 [hep-ph]},
editor = {?},
refereed = {yes},
length = {8},
url = {https://arxiv.org/abs/1906.05829}
}
author = {J. Ablinger and J. Blümlein and P. Marquard and N. Rana and C. Schneider},
title = {{Three loop heavy quark form factors and their asymptotic behavior}},
booktitle = {{To appear in Proc.of 23rd DAE-BRNS High Energy Physics Symposium 2018}},
language = {english},
pages = {?--?},
isbn_issn = {?},
year = {2021},
note = {arXiv:1906.05829 [hep-ph]},
editor = {?},
refereed = {yes},
length = {8},
url = {https://arxiv.org/abs/1906.05829}
}
[Schneider]
A case study for ζ(4)
Carsten Schneider, Wadim Zudilin
In: Proceedings of the conference 'Transient Transcendence in Transylvania', Alin Bostan and Kilian Raschel (ed.), Proceedings in Mathematics & Statistics , pp. ?-?. 2021. Springer, arXiv:2004.08158 [math.NT]. [url]@incollection{RISC6210,
author = {Carsten Schneider and Wadim Zudilin},
title = {{A case study for ζ(4)}},
booktitle = {{Proceedings of the conference 'Transient Transcendence in Transylvania'}},
language = {english},
series = {Proceedings in Mathematics & Statistics},
pages = {?--?},
publisher = {Springer},
isbn_issn = {?},
year = {2021},
note = {arXiv:2004.08158 [math.NT]},
editor = {Alin Bostan and Kilian Raschel},
refereed = {no},
length = {0},
url = {https://arxiv.org/abs/2004.08158}
}
author = {Carsten Schneider and Wadim Zudilin},
title = {{A case study for ζ(4)}},
booktitle = {{Proceedings of the conference 'Transient Transcendence in Transylvania'}},
language = {english},
series = {Proceedings in Mathematics & Statistics},
pages = {?--?},
publisher = {Springer},
isbn_issn = {?},
year = {2021},
note = {arXiv:2004.08158 [math.NT]},
editor = {Alin Bostan and Kilian Raschel},
refereed = {no},
length = {0},
url = {https://arxiv.org/abs/2004.08158}
}
[Schneider]
On Rational and Hypergeometric Solutions of Linear Ordinary Difference Equations in ΠΣ∗-field extensions
Sergei A. Abramov, Manuel Bronstein, Marko Petkovšek, Carsten Schneider
J. Symb. Comput. 107, pp. 23-66. 2021. ISSN 0747-7171. arXiv:2005.04944 [cs.SC]. [url]@article{RISC6224,
author = {Sergei A. Abramov and Manuel Bronstein and Marko Petkovšek and Carsten Schneider},
title = {{On Rational and Hypergeometric Solutions of Linear Ordinary Difference Equations in ΠΣ∗-field extensions}},
language = {english},
journal = {J. Symb. Comput.},
volume = {107},
pages = {23--66},
isbn_issn = {ISSN 0747-7171},
year = {2021},
note = {arXiv:2005.04944 [cs.SC]},
refereed = {yes},
length = {44},
url = {https://doi.org/10.1016/j.jsc.2021.01.002}
}
author = {Sergei A. Abramov and Manuel Bronstein and Marko Petkovšek and Carsten Schneider},
title = {{On Rational and Hypergeometric Solutions of Linear Ordinary Difference Equations in ΠΣ∗-field extensions}},
language = {english},
journal = {J. Symb. Comput.},
volume = {107},
pages = {23--66},
isbn_issn = {ISSN 0747-7171},
year = {2021},
note = {arXiv:2005.04944 [cs.SC]},
refereed = {yes},
length = {44},
url = {https://doi.org/10.1016/j.jsc.2021.01.002}
}
[Schneider]
The Polarized Transition Matrix Element $A_{g, q}(N)$ of the Variable Flavor Number Scheme at $O(alpha_s^3)$
A. Behring, J. Blümlein, A. De Freitas, A. von Manteuffel, K. Schönwald, and C. Schneider
Nuclear Physics B 964, pp. 115331-115356. 2021. ISSN 0550-3213. arXiv:2101.05733 [hep-ph]. [url]@article{RISC6278,
author = {A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and K. Schönwald and and C. Schneider},
title = {{The Polarized Transition Matrix Element $A_{g,q}(N)$ of the Variable Flavor Number Scheme at $O(alpha_s^3)$}},
language = {english},
journal = {Nuclear Physics B},
volume = {964},
pages = {115331--115356},
isbn_issn = {ISSN 0550-3213},
year = {2021},
note = {arXiv:2101.05733 [hep-ph]},
refereed = {yes},
length = {26},
url = {https://doi.org/10.1016/j.nuclphysb.2021.115331}
}
author = {A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and K. Schönwald and and C. Schneider},
title = {{The Polarized Transition Matrix Element $A_{g,q}(N)$ of the Variable Flavor Number Scheme at $O(alpha_s^3)$}},
language = {english},
journal = {Nuclear Physics B},
volume = {964},
pages = {115331--115356},
isbn_issn = {ISSN 0550-3213},
year = {2021},
note = {arXiv:2101.05733 [hep-ph]},
refereed = {yes},
length = {26},
url = {https://doi.org/10.1016/j.nuclphysb.2021.115331}
}
[Schneider]
Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation
C. Schneider
In: Anti-Differentiation and the Calculation of Feynman Amplitudes, J. Blümlein and C. Schneider (ed.), Texts and Monographs in Symbolic Computuation to appear, pp. ?-?. 2021. Springer, arXiv:2102.01471 [cs.SC], RISC-Linz Report Series No. 21-03. [url]@incollection{RISC6287,
author = {C. Schneider},
title = {{Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation}},
booktitle = {{Anti-Differentiation and the Calculation of Feynman Amplitudes}},
language = {english},
series = {Texts and Monographs in Symbolic Computuation},
volume = {to appear},
pages = {?--?},
publisher = {Springer},
isbn_issn = {?},
year = {2021},
note = {arXiv:2102.01471 [cs.SC], RISC-Linz Report Series No. 21-03},
editor = {J. Blümlein and C. Schneider},
refereed = {yes},
length = {55},
url = {https://arxiv.org/abs/2102.01471}
}
author = {C. Schneider},
title = {{Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation}},
booktitle = {{Anti-Differentiation and the Calculation of Feynman Amplitudes}},
language = {english},
series = {Texts and Monographs in Symbolic Computuation},
volume = {to appear},
pages = {?--?},
publisher = {Springer},
isbn_issn = {?},
year = {2021},
note = {arXiv:2102.01471 [cs.SC], RISC-Linz Report Series No. 21-03},
editor = {J. Blümlein and C. Schneider},
refereed = {yes},
length = {55},
url = {https://arxiv.org/abs/2102.01471}
}
[Schneider]
The Logarithmic Contributions to the Polarized $O(alpha_s^3)$ Asymptotic Massive Wilson Coefficients and Operator Matrix Elements in Deeply Inelastic Scattering
J. Blümlein, A. De Freitas, M. Saragnese, K. Schönwald, C. Schneider
Technical report no. 21-06 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Schloss Hagenberg, 4232 Hagenberg, Austria. 2021. [pdf]@techreport{RISC6292,
author = {J. Blümlein and A. De Freitas and M. Saragnese and K. Schönwald and C. Schneider},
title = {{The Logarithmic Contributions to the Polarized $O(alpha_s^3)$ Asymptotic Massive Wilson Coefficients and Operator Matrix Elements in Deeply Inelastic Scattering}},
language = {english},
number = {21-06},
year = {2021},
length = {86},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
author = {J. Blümlein and A. De Freitas and M. Saragnese and K. Schönwald and C. Schneider},
title = {{The Logarithmic Contributions to the Polarized $O(alpha_s^3)$ Asymptotic Massive Wilson Coefficients and Operator Matrix Elements in Deeply Inelastic Scattering}},
language = {english},
number = {21-06},
year = {2021},
length = {86},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}
[Schneider]
Iterated integrals over letters induced by quadratic forms
J. Ablinger, J. Blümlein, C. Schneider
Physical Review D to appear, pp. -. 2021. ISSN 2470-0029. arXiv:2103.08330 [hep-th]. [url]@article{RISC6294,
author = {J. Ablinger and J. Blümlein and C. Schneider},
title = {{Iterated integrals over letters induced by quadratic forms}},
language = {english},
journal = {Physical Review D },
volume = {to appear},
pages = {--},
isbn_issn = {ISSN 2470-0029},
year = {2021},
note = {arXiv:2103.08330 [hep-th]},
refereed = {yes},
length = {14},
url = {https://arxiv.org/abs/2103.08330}
}
author = {J. Ablinger and J. Blümlein and C. Schneider},
title = {{Iterated integrals over letters induced by quadratic forms}},
language = {english},
journal = {Physical Review D },
volume = {to appear},
pages = {--},
isbn_issn = {ISSN 2470-0029},
year = {2021},
note = {arXiv:2103.08330 [hep-th]},
refereed = {yes},
length = {14},
url = {https://arxiv.org/abs/2103.08330}
}
[Schneider]
Solving linear difference equations with coefficients in rings with idempotent representations
J. Ablinger, C. Schneider
In: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation (Proc. ISSAC 21), Marc Mezzarobba (ed.), to appear , pp. ?-?. 2021. ISBN 978-1-4503-8382-0/21/06. arXiv:2102.03307 [cs.SC].@inproceedings{RISC6302,
author = {J. Ablinger and C. Schneider},
title = {{Solving linear difference equations with coefficients in rings with idempotent representations}},
booktitle = {{Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation (Proc. ISSAC 21)}},
language = {english},
series = {to appear},
pages = {?--?},
isbn_issn = {ISBN 978-1-4503-8382-0/21/06},
year = {2021},
note = {arXiv:2102.03307 [cs.SC]},
editor = {Marc Mezzarobba},
refereed = {yes},
length = {8}
}
author = {J. Ablinger and C. Schneider},
title = {{Solving linear difference equations with coefficients in rings with idempotent representations}},
booktitle = {{Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation (Proc. ISSAC 21)}},
language = {english},
series = {to appear},
pages = {?--?},
isbn_issn = {ISBN 978-1-4503-8382-0/21/06},
year = {2021},
note = {arXiv:2102.03307 [cs.SC]},
editor = {Marc Mezzarobba},
refereed = {yes},
length = {8}
}
[STUDENT]
Refinement Types for Elm
Lucas Payr
Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. Master Thesis. April 2021. Also available as RISC report no. 21-10. Master Thesis. [pdf]@misc{RISC6304,
author = {Lucas Payr},
title = {{Refinement Types for Elm}},
language = {english},
abstract = {The aim of this thesis is to add refinement types to Elm. Elm is a pure functionalprogramming language that uses a Hindley-Miler type system. Refinement types aresubtypes of existing types. These subtypes are defined by a predicate that specifieswhich values are part of the subtypes. To extend a Hindley-Miler type system, onecan use so-called liquid types. These are special refinement types that come with analgorithm for type inference. This algorithm interacts with an SMT solver to solvesubtyping conditions. A type system using liquid types is not complete, meaning notevery valid program can be checked. Instead, liquid types are only defined for a subsetof expressions and only allow specific predicates. In this thesis, we give a formaldefinition of the Elm language and its type system. We extend the type system withliquid types and provide a subset of expressions and a subset of predicates such thatthe extended type system is sound. We use the free software system “K Framework”for rapid prototyping of the formal Elm type system. For rapid prototyping of thecore algorithm of the extended type system we implemented said algorithm in Elmand checked the subtyping condition in Microsoft’s SMT solver Z3.},
year = {2021},
month = {April},
note = {Also available as RISC report no. 21-10},
translation = {0},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria},
keywords = {formal semantics, formal type systems, programming languages, satisfiability solving},
length = {135},
type = {Master Thesis}
}
author = {Lucas Payr},
title = {{Refinement Types for Elm}},
language = {english},
abstract = {The aim of this thesis is to add refinement types to Elm. Elm is a pure functionalprogramming language that uses a Hindley-Miler type system. Refinement types aresubtypes of existing types. These subtypes are defined by a predicate that specifieswhich values are part of the subtypes. To extend a Hindley-Miler type system, onecan use so-called liquid types. These are special refinement types that come with analgorithm for type inference. This algorithm interacts with an SMT solver to solvesubtyping conditions. A type system using liquid types is not complete, meaning notevery valid program can be checked. Instead, liquid types are only defined for a subsetof expressions and only allow specific predicates. In this thesis, we give a formaldefinition of the Elm language and its type system. We extend the type system withliquid types and provide a subset of expressions and a subset of predicates such thatthe extended type system is sound. We use the free software system “K Framework”for rapid prototyping of the formal Elm type system. For rapid prototyping of thecore algorithm of the extended type system we implemented said algorithm in Elmand checked the subtyping condition in Microsoft’s SMT solver Z3.},
year = {2021},
month = {April},
note = {Also available as RISC report no. 21-10},
translation = {0},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria},
keywords = {formal semantics, formal type systems, programming languages, satisfiability solving},
length = {135},
type = {Master Thesis}
}
