- 2023
- 2022
- 2020
- 2019
- 2018
- 2017
- 2016
- 2015
- 2014
- 2013
- 2012
- 2011
- 2010
- 2009
- 2008
- 2007
- 2006
- 2005
- 2004
- 2003
- 2002
- 2001
- 2000
- 1999
- 1998
- 1997
- 1996
- 1995
- 1994
- 1993
- 1992
- 1991
- 1990
- 1989
- 1988
- 1987
- 1986
- 1985
- 1984
- 1983
- 1982
- 1981
- 1980
- 1979
論文代碼
TR-IIS-19-001
標題 / 作者 / 摘要
A Prehistoric Calculator
Kelly McKennon
檢視
論文代碼
TR-IIS-19-002
標題 / 作者 / 摘要
Equational reasoning for non-determinism monad: the case of Spark aggregation
Shin-Cheng Mu
檢視
論文代碼
TR-IIS-19-003
標題 / 作者 / 摘要
Calculating a backtracking algorithm: an exercise in monadic program derivation
Shin-Cheng Mu
Equational reasoning is among the most important tools that functional programming provides us. Curiously, relatively less attention has been paid to reasoning about monadic programs. In this report we derive a backtracking algorithm for problem specifications that use a monadic unfold to generate possible solutions, which are filtered using a scanl-like predicate. We develop theorems that convert a variation of scanl to a foldr that uses the state monad, as well as theorems constructing hylomorphism.
The algorithm is used to solve the n-queens puzzle, our running example. The aim is to develop theorems and patterns useful for the derivation of monadic programs, focusing on the intricate interaction between state and non-determinism.
檢視
論文代碼
IM-IIS-19-001
標題 / 作者 / 摘要
MinProtMaxVP: Generating a minimized number of protein variant sequences containing all possible variant peptides by solving a set covering problem
Wai-Kok Choong, Jen-Hung Wang, and Ting-Yi Sung
檢視
not for public 原文請洽圖書室