Dependent type theory is rich enough to express that a program satisfies an input/output relational specification, but it could be hard to construct the proof term. On the other hand, squiggolists know very well how to show that one relation is included in another by algebraic reasoning. We demonstrate how to encode functional and relational derivations in a dependently typed programming language. A program is coupled with an algebraic derivation from a specification, whose correctness is guaranteed by the type system. Code accompanying the paper has been developed into an Agda library AoPA.
In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku.Our survey of applications shows the difference map algorithm often achieves results comparable to much more sophisticated, special purpose algorithms. Efficient implementations of constraint projections usually are easier than designing the linear program solver at the heart of many optimization algorithms.
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so far. We present the design and semantics of a simple yet expressive first-class component system for ML. It provides dynamic linking in a type-safe and type-flexible manner, and allows selective execution in sandboxes. The system is defined solely by reduction to higher-order modules plus an extension with simple module-level dynamics, which we call packages. To represent components outside processes we employ generic pickling. We give a module calculus formalising the semantics of packages and pickling.
A Tutorial Implementation of a Dependently Typed Lambda Calculus Andres Löh, Conor McBride and Wouter Swierstra We present the type rules for a dependently-typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary to shift from a simply-typed lambda calculus to the dependently-typed lambda calculus. We also describe how to extend our core language with data types and write several small example programs. The paper is accompanied by an executable interpreter and example code that allows immediate experimentation with the system we describe. Download Draft Paper (submitted to FI) Haskell source code (executable Haskell file containing all the code from the paper plus the interpreter; automatically generated from the paper sources) prelude.lp (prelude for the LambdaPi interpreter, containing several example programs) Instructions (how to get started with the LambdaPi interpreter)
Scientific publishing as it stands is an inefficient way to do science on a global scale. A lot of time and money is being wasted by groups around the world duplicating research that has already been carried out. FigShare allows you to share all of your data, negative results and unpublished figures.
Last week's post (The truth about vaccinations: Your physician knows more than the University of Google) sparked a very lively discussion, with comments from several people trying to persuade me (and the other readers) that their paper disproved everything that I'd been saying. While I encourage you to go read the comments and contribute your…
C. Weng, B. Curless, and I. Kemelmacher-Shlizerman. (2018)cite arxiv:1812.02246Comment: The project page is at https://grail.cs.washington.edu/projects/wakeup/, and the supplementary video is at https://youtu.be/G63goXc5MyU.
C. Danescu-Niculescu-Mizil, R. West, D. Jurafsky, J. Leskovec, and C. Potts. Proceedings of the 22nd international conference on World Wide Web, page 307--318. Republic and Canton of Geneva, Switzerland, International World Wide Web Conferences Steering Committee, (2013)
J. Schehl, A. Pfalzgraf, N. Pfleger, and J. Steigner. Proceedings of the 10th International Conference on Multimodal Interfaces (ICMI '08), Chania, Crete, Greece, page 77-80. (2008)
R. Gupta, and S. Sarawagi. Proceedings of the fourth ACM international conference on Web search and data mining, page 217--226. New York, NY, USA, ACM, (2011)
A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. Proceedings of the Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures, page 87-102. Aalborg University Press, (February 2006)
R. Kawase, G. Papadakis, E. Herder, and W. Nejdl. Proc. of 22nd ACM conference on Hyptertext and Hypermedia (HT), June 2011, Eindhoven, The Netherlands., (2011)
C. Wang, J. Han, Y. Jia, J. Tang, D. Zhang, Y. Yu, and J. Guo. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 203--212. New York, NY, USA, ACM, (2010)
S. Lohmann, P. Heim, L. Tetzlaff, T. Ertl, and J. Ziegler. Proceedings of the 4th International Conference on Semantic and Digital Media Technologies (SAMT 2009), page 16--27. Berlin, Heidelberg, Springer, (2009)
B. Roth, G. Chrupala, M. Wiegand, M. Singh, and D. Klakow. Proceedings of the Fifth Text Analysis Conference (TAC 2012), Gaithersburg, Maryland, USA, National Institute of Standards and Technology (NIST), (November 2012)
C. Wang, and D. Blei. Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 448--456. New York, NY, USA, ACM, (2011)
F. Mattern, and C. Floerkemeier. From Active Data Management to Event-Based Systems and More, volume 6462 of Lecture Notes in Computer Science, Springer, Berlin, (2010)