An Approach to Call-by-Name Delimited Continuations

International audienceWe show that a variant of Parigot's λμ-calculus, originally due to de Groote and proved to satisfy Böhm's theorem by Saurin, is canonically interpretable as a call-by-name calculus of delim- ited control. This observation is expressed using Ariola et al's call-by-value calculus of delimited control, an extension of λμ-calculus with delimited control known to be equationally equivalent to Danvy and Filinski's calculus with shift and reset. Our main result then is that de Groote and Saurin's variant of λμ-calculus is equivalent to a canonical call-by-name variant of Ariola et al's calculus. The rest of the paper is devoted to a comparative study of the call-by-name and call-by-value variants of Ariola et al's calculus, covering in particular the questions of simple typing, operational semantics, and continuation-passing-style semantics. Finally, we discuss the relevance of Ariola et al's calculus as a uniform framework for representing different calculi of delimited continuations, including "lazy" variants such as Sabry's shift and lazy reset calculus

北海道における知的障がい者の就労支援に関する一考察

知的障がい者の就労について、北海道及び北海道教育委員会が進めている障が いのある人の就労支援の充実に向けた取組の状況を概観することに加えて、北海道内 の特別支援学校在籍者の約８割を占めている知的障がい特別支援学校の現状や就労支 援の取組について整理した。北海道において障がいある人の就労に大きな役割を果た してきた職親会の設立の経緯やなよろ地方職親会の障がい者雇用の状況やジョブコー チ養成研修の成果をまとめた。以上のことを踏まえて、知的障がい者の就労支援やキ ャリア教育の在り方について考察する

Hypergraph polytopes

AbstractWe investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra. In between, as notable members one finds associahedra and cyclohedra. The polytopes in this family are investigated here both as abstract polytopes and as realized in Euclidean spaces of all finite dimensions. The later realizations are inspired by J.D. Stasheff ʼs and S. Shniderʼs realizations of associahedra. In these realizations, passing from simplices to permutohedra, via associahedra, cyclohedra and other interesting polytopes, involves truncating vertices, edges and other faces. The results presented here reformulate, systematize and extend previously obtained results, and in particular those concerning polytopes based on constructions of graphs, which were introduced by M. Carr and S.L. Devadoss

Logic Lectures: Gödel's Basic Logic Course at Notre Dame

An edited version is given of the text of Goedel’s unpublished manuscript of the notes for a course in basic logic he delivered at the University of Notre Dame in 1939. Goedel’s notes deal with what is today considered as important logical problems par excellence, completeness, decidability, independence of axioms, and with natural deduction too, which was all still a novelty at the time the course was delivered. Full of regards towards beginners, the notes are not excessively formalistic. Goedel presumably intended them just for himself, and they are full of abbreviations. This together with some other matters (like two versions of the same topic, and guessing the right order of the pages) required additional effort to obtain a readable edited version. Because of the quality of the material provided by Goedel, including also important philosophical points, this effort should however be worthwhile. The edited version of the text is accompanied by another version, called the source version, which is quite close to Goedel’s manuscript. It is meant to be a record of the editorial interventions involved in producing the edited version (in particular, how the abbreviations were disabridged), and a justification of that later version