Logic-ml

9 participants
1782 discussions

オートマトン&ロジックワークショップ開催の案内@秋田大(3/26~3/27)
by Ryoma Sin'ya 18 Feb '19

18 Feb '19

みなさま，秋田大学の新屋です． 3月26日(火)・3月27日(水)の2日間，秋田大学にてオートマトンとロジックのワークショップを開催します．会場情報やプログラム・講演概要を下記のページにて公開しています．皆様どうぞ奮ってご参加ください． https://sites.google.com/view/automata-logic-akita2019/home <https://sites.google.com/view/automata-logic-akita2019/home> 聴講参加は申し込みは不要です．懇親会については事前に人数を把握しておきたいため，参加希望の方は 3月11日(月)までに新屋に懇親会参加の旨をご連絡いただけると幸いです．秋田大学数理科学コース新屋良磨

1 0

公募（助教：東工大情報理工学院情報工学系）
by Shin-ya Nishizaki 15 Feb '19

15 Feb '19

皆様下記の通り，助教の公募を致しておりますので，ご検討の程お願い申し上げます。東京工業大学学術国際情報センター西崎真也職名：助教〆切：２０１９年３月１日職務内容：情報理工学院計算機室の保守管理，および計算機演習の補助・ PBL に基づくソフトウェア開発実習の補助を担当する。教育・研究のエフォートは各々５０％・５０％である。分野：情報工学一般，特に，情報工学基礎（数理論理学，計算理論，プログラム理論，等），ソフトウェア関連分野など公募の詳細は下記をご参照ください。 http://www.hyoka.koho.titech.ac.jp/eprd/recently/koubo/koubo.php

1 0

【論文募集】Haskell Symposium 2019@ベルリン【Early Track〆切：3/15，Regular Track〆切：5/10，会議：8/22-23】
by Kazutaka Matsuda 15 Feb '19

15 Feb '19

# 複数受けとられた方はご容赦ください．皆様，東北大学の松田です． ICFP 2019併設の国際会議Haskell Symposium 2019（8/22-8/23@ベルリン）の論文募集の案内を御送りいたします．重要な日程は以下の通りです． Early Track: 投稿〆切：3/15 採否通知：4/19 Regular Track and Demo: 投稿〆切：5/10 採否通知：6/21 会議：8/22-8/23 何卒投稿をご検討いただけますと幸いです． CFPにあります通り，今年は軽量double blind reviewを採用しております．投稿時はお気をつけください． ================================================================================ ACM SIGPLAN CALL FOR SUBMISSIONS Haskell Symposium 2019 Berlin, Germany 22--23 August, 2019 http://www.haskell.org/haskell-symposium/2019/ ================================================================================ The ACM SIGPLAN Haskell Symposium 2019 will be co-located with the 2019 International Conference on Functional Programming (ICFP). **NEW THIS YEAR**: We will be using a lightweight double-blind reviewing process. See further information below. The Haskell Symposium presents original research on Haskell, discusses practical experience and future development of the language, and promotes other forms of declarative programming. Topics of interest include: * Language design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Functional Pearls, being elegant and instructive programming examples; * Experience Reports, to document general practice and experience in education, industry, or other contexts; * System Demonstrations, based on running software rather than novel research results. Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work, and to other languages where appropriate. Experience reports and functional pearls need not necessarily report original academic research results. For example, they may instead report reusable programming idioms, elegant ways to approach a problem, or practical experience that will be useful to other users, implementers, or researchers. The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a standard solution to a standard programming problem, or report on experience where you used Haskell in the standard way and achieved the result you were expecting. System demonstrations should summarize the system capabilities that would be demonstrated. The proposals will be judged on whether the ensuing session is likely to be important and interesting to the Haskell community at large, whether on grounds academic or industrial, theoretical or practical, technical, social or artistic. Please contact the program chair with any questions about the relevance of a proposal. Submission Details ================== Early and Regular Track ----------------------- The Haskell Symposium uses a two-track submission process so that some papers can gain early feedback. Strong papers submitted to the early track are accepted outright, and the others will be given their reviews and invited to resubmit to the regular track. Papers accepted via the early and regular tracks are considered of equal value and will not be distinguished in the proceedings. Although all papers may be submitted to the early track, authors of functional pearls and experience reports are particularly encouraged to use this mechanism. The success of these papers depends heavily on the way they are presented, and submitting early will give the program committee a chance to provide feedback and help draw out the key ideas. Formatting ---------- Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Authors should use the `acmart` format, with the `sigplan` sub-format for ACM proceedings. For details, see: http://www.sigplan.org/Resources/Author/#acmart-format It is recommended to use the `review` option when submitting a paper; this option enables line numbers for easy reference in reviews. Functional pearls, experience reports, and demo proposals should be labelled clearly as such. Lightweight Double-blind Reviewing ---------------------------------- Haskell Symposium 2019 will use a lightweight double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules: 1. Author names and institutions must be omitted, and 2. References to authors’ own related work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). The purpose of this process is to help the reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. A reviewer will learn the identity of the author(s) of a paper after a review is submitted. Page Limits ----------- The length of submissions should not exceed the following limits: Regular paper: 12 pages Functional pearl: 12 pages Experience report: 6 pages Demo proposal: 2 pages There is no requirement that all pages are used. For example, a functional pearl may be much shorter than 12 pages. In all cases, the list of references is not counted against these page limits. Deadlines --------- Early track: Submission deadline: 15 March 2019 (Fri) Notification: 19 April 2019 (Fri) Regular track and demos: Submission deadline: 10 May 2019 (Fri) Notification: 21 June 2019 (Fri) Camera-ready deadline for accepted papers: 30 June 2019 (Thu) Deadlines are valid anywhere on Earth. Submission ---------- Submissions must adhere to SIGPLAN's republication policy (http://sigplan.org/Resources/Policies/Republication/), and authors should be aware of ACM's policies on plagiarism (https://www.acm.org/publications/policies/plagiarism). The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. Papers should be submitted through HotCRP at: https://haskell19.hotcrp.com/ Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Supplementary material: Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. This supplementary material should not be submitted as part of the main document; instead, it should be uploaded as a separate PDF document or tarball. Supplementary material should be uploaded at submission time, not by providing a URL in the paper that points to an external repository. Authors are free to upload both anonymized and non-anonymized supplementary material. Anonymized supplementary material will be visible to reviewers immediately; non-anonymized supplementary material will be revealed to reviewers only after they have submitted their review of the paper and learned the identity of the author(s). Resubmitted Papers: Authors who submit a revised version of a paper that has previously been rejected by another conference have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the principal editor will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Travel Support ============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page (http://pac.sigplan.org). Proceedings =========== Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance (http://authors.acm.org/main.html). Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Accepted proposals for system demonstrations will be posted on the symposium website but not formally published in the proceedings. All accepted papers and proposals will be posted on the conference website one week before the meeting. Publication date: The official publication date of accepted papers is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Program Committee ================= Ki-Yung Ahn Hannam University Christiaan Baaij QBayLogic B.V. José Manuel Calderón Trilla Galois, Inc Benjamin Delaware Purdue University Richard Eisenberg (chair) Bryn Mawr College Jennifer Hackett University of Nottingham Kazutaka Matsuda Tohoku University Trevor McDonnell Utrecht University Ivan Perez NIA / NASA Formal Methods Nadia Polikarpova University of California, San Diego Norman Ramsey Tufts University Christine Rizkallah University of New South Wales Eric Seidel Bloomberg LP Alejandro Serrano Mena Utrecht University John Wiegley Dfinity Foundation Thomas Winant Well-Typed LLP Ningning Xie University of Hong Kong If you have questions, please contact the chair at: rae(a)cs.brynmawr.edu ================================================================================

1 0

理論計算機科学と圏論ワークショップ（CSCAT 2019）3/9-10
by MIYOSHI HIROYUKI 09 Feb '19

09 Feb '19

各メーリングリストの皆様，京都産業大学の三好です。理論計算機科学と圏論ワークショップ（CSCAT 2019）が3/9-10に行われるとのことです。私もさきほど知ったところです。 cs_catメーリングリストには入っていたはずなのですが…… 京都産業大学理学部数理科学科三好博之 hxm(a)cc.kyoto-su.ac.jp ---------- 転送メッセージ --------- From: Kensuke Kojima <kozima(a)kuis.kyoto-u.ac.jp> 日付: 2019年1月13日(日) 12:41 件名: CSCAT 2019 開催案内 To: <cs_cat(a)group-mmm.org> CSCAT メーリングリストの皆様、京都大学の小島です。今年の CSCAT のお知らせです。日時： 2019年3月9日（土）〜3月10日（日）会場：東北大学理学部数理科学記念館（川井ホール） URL：https://sites.google.com/view/cscat2019/home 連絡先：cscat2019(a)grp.tohoku.ac.jp 今年は会場の手配を東北大学の赤間先生にお願いして、講演の取りまとめを小島が行う形で開催することになりました。懇親会を3月9日の夜に行う予定です。予算は一人6000円程度の見込みです。講演・懇親会への参加を希望される方は2月22日までに、それぞれ以下の申し込みフォームへご記入下さい。（聴講のみで懇親会にも参加されない場合は申し込み不要です。）講演申し込み https://goo.gl/forms/DscPaYGBsIbUFDua2 懇親会申し込み https://goo.gl/forms/7cCq16mOxlV1GZ6o2 皆様の参加をお待ちしております。小島

1 0

JAIST Logic Seminar Series (Feb 26, 13:30-15:30)
by Nao Hirokawa 08 Feb '19

08 Feb '19

皆様２月２６日（火）に行われます、ウィーン工科大学 Matthias Baaz 先生とインスブルック大学 Cezary Kaliszyk 先生の講演のお知らせです。皆様、どうぞ奮ってご参加ください。廣川　直（北陸先端科学技術大学院大学情報科学系） ----------------------------------------------------------------------- * JAIST Logic Seminar Series * Date: Feb 26 (Tue), 2019, 13:30 - 15:30 Place: I-56 (Collaboration Room 7) on 5F of IS Building III at JAIST (Access: http://www.jaist.ac.jp/english/location/access.html) -*- -*- -*- -*- -*- -*- -*- -*- -*- Speaker: Matthias Baaz (Vienna University of Technology) Title: On the benefit of unsound rules: Henkin quantifiers and beyond Abstract: We give examples of analytic sequent calculi LK+ and LK++ that extend Gentzen's sequent calculus LK by unsound quantifier rules in such a way that i) derivations lead only to true sequents, ii) cut free proofs may be non-elementary shorter than cut free LK proofs. This research is based on properties of Hilbert's epsilon calculus and is part of efforts to complement Hilbert's stepwise concept of proof by useful global concepts. We use these ideas to provide analytic calculi for Henkin quantifiers demonstrate soundness, (cut free) completeness and cut elimination. Furthermore, we show, that in the case of quantifier macros such as Henkin quantifiers for a partial semantics global calculi are the only option to preserve analyticity. -*- -*- -*- -*- -*- -*- -*- -*- -*- Speaker: Cezary Kaliszyk (University of Innsbruck) Title: Learning Theorem Proving from Scratch Abstract: Machine learning can in some domains find algorithms that are better than human heuristics. In this talk we will look at various theorem proving problems and their heuristics, and see which of those can be replaces by machine learned strategies. Instead of typical brute-force search, we will consider Monte-Carlo simulations guided by reinforcement learning from previous proof attempts. Various predictors for estimating the usefulness of proof steps and the likelihood of closing the open tableaux branches will be compared. -----------------------------------------------------------------------

1 0

【参加募集（交通案内更新）】第21回プログラミングおよびプログラミング言語ワークショップ（PPL2019）
by Kazuyuki ASADA 05 Feb '19

05 Feb '19

PPLの皆様（重複ご容赦ください），東北大学の浅田です． 3月6日(水) 〜 8日(金)に，岩手県花巻市で開催される，第21回プログラミングおよびプログラミング言語ワークショップ (PPL2019) の参加登録のご案内をいたします．多くの方々のご参加をお待ちしております．会議の終了時間の情報と送迎バスの情報を更新致しました： https://jssst-ppl.org/workshop/2019/access.html 航空券の28日前早割の期限が間近ですので，よろしければご検討ください．参加登録の締切は2月20日(水)です．どうぞお早めのご登録をお願い致します．あわせて，送迎バスのアンケートへのご協力をよろしくお願い致します． -------------------------------------------------------------------------- 第21回プログラミングおよびプログラミング言語ワークショップ（PPL2019） https://jssst-ppl.org/workshop/2019/ 参加登録のご案内主催: 日本ソフトウェア科学会プログラミング論研究会日程: 2019年3月6日(水) 〜 8日(金) 会場: 岩手県花巻市志戸平温泉「湯の杜ホテル志戸平」 PPL2019は，プログラミングとプログラミング言語に関連する幅広い分野の研究者・技術者・学生が一堂に会し，最新の研究成果の発表や，新たな研究課題の提案・討論・アイディア交換を行うことを目的とした，合宿形式の研究集会です．参加登録ならびに宿泊予約を日本旅行のウェブサービスにて受け付けております．参加費および参加登録方法については次のウェブページをご参照ください． https://jssst-ppl.org/workshop/2019/registration.html 参加登録締切：2019年2月20日(水) 問い合わせ先： ppl2019-oc(a)googlegroups.xn--com()-m53d8hra6b34cycyguk0hje6i3045cmp3h ppl2019-pc-chair(a)jssst-ppl.xn--org(/)-043e5ita1c46ctozdpfoc1401qpyjc ================================================================ ・プログラム委員会笹田耕一 (クックパッド)[プログラム共同委員長] 末永幸平 (京都大学)[プログラム共同委員長] 青谷知幸 (東京工業大学) 赤間陽二 (東北大学) 浅井健一 (お茶の水女子大学) 稲葉一浩 (Google) 鵜川始陽 (高知工科大学) 遠藤侑介 (クックパッド) Jacques Garrigue (名古屋大学) Oleg Kiselyov (東北大学) 酒井政裕 (PFN) 佐藤重幸 (東京大学) 関山太朗 (国立情報学研究所) 高野保真 (青山学院大学) 田中哲 (産業技術総合研究所) 千代英一郎 (成蹊大学) 千葉滋 (東京大学) 塚田武志 (東京大学) 照井一成 (京都大学) 中澤巧爾 (名古屋大) 林崎弘成 (Google) 平井洋一 (brainbot technologies AG) 堀江倫大 (日本IBM) 前田敦司 (筑波大学) 森畑明昌 (東京大学) 山田晃久 (国立情報学研究所) ・組織委員会浅田和之 (東北大学)[組織委員長] 平石拓 (京都大学)[組織副委員長] 木村大輔 (東邦大学)[財務担当] 森口草介 (関西学院大学)[財務副担当] 新屋良磨 (秋田大学)[会場担当] 安部達也 (千葉工業大学)[会場副担当] 佐藤亮介 (九州大学)[渉外担当] 笹田耕一 (クックパッド)[プログラム共同委員長] 末永幸平 (京都大学)[プログラム共同委員長] ================================================================

1 0

【論文募集】Bx 2019 (Workshop on Bidirectional Transformations)【2/12アブスラクト〆切】
by Kazutaka Matsuda 31 Jan '19

31 Jan '19

複数お受けとられた方はご容赦ください．東北大学の松田です．来たる6月4日に開催される双方向変換に関する国際ワークショップ Bx 2019 のご案内を御送りいたします．〆切等の日程は以下となっております．アブストラクト〆切：2/12 (AoE) 論文〆切：2/19 (AoE) 採否通知：4/8 カメラレディ〆：5/1前後〆切まで日数が近くギリギリの案内で恐縮ですが，どうぞご投稿を検討いただければ幸いです． Bx 2019: 8th International Workshop on Bidirectional Transformations ==================================================================== Highlights: - workshop date set on June 4, 2019 - Zachary Ives confirmed as invited speaker - abstract submission in two weeks (Tuesday, Feb 12, AoE) - links to CEUR-WS.org style and template files updated * http://bx-community.wikidot.com/bx2019:home * June 4, 2019, Saint Joseph’s University, Philadelphia, PA, USA * as part of Philadelphia Logic Week (PLW) 2019: https://sites.sju.edu/plw/ * Invited speaker: Zachary Ives (University of Pennsylvania) Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational databases, software models and code, or any other document following standard or ad-hoc formats. Bx are an emerging topic in a wide range of research areas, with prominent presence at top conferences in several different fields (namely databases, programming languages, software engineering, and graph transformation), but with results in one field often getting limited exposure in the others. Bx 2019 is a dedicated venue for bx in all relevant fields, and is part of a workshop series that was created in order to promote cross-disciplinary research and awareness in the area. As such, since its beginning in 2012, the workshop has rotated between venues in different fields. Bx 2019 will be a part of Philadelphia Logic Week (PLW) 2019, which also includes conference and workshops on logic, provenance, and databases, topics that we hope will complement Bx and help build engagement with these communities. Important Dates =============== - Abstract submission: Feb 12 (AoE) - Paper submission: Feb 19 (AoE) - Author notification: Apr 8 - Camera-ready: around May 1 - Workshop: Jun 4, 2019 Aims and Topics =============== The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bx from different perspectives, including but not limited to: - bidirectional programming languages and frameworks - data and model synchronization - view updating - inter-model consistency analysis and repair - data/schema (or model/metamodel) co-evolution - coupled software/model transformations - inversion of transformations and data exchange mappings - domain-specific languages for bx - analysis and classification of requirements for bx - bridging the gap between formal concepts and application scenarios - analysis of efficiency of transformation algorithms and benchmarks - survey and comparison of bx technologies - case studies and tool support Submission Guidelines ===================== Papers must follow the CEUR-WS.org one-column style (with page numbers) available at - http://ceur-ws.org/Vol-XXX/samplestyles/onecolpceurws.sty and must be submitted via EasyChair: - https://www.easychair.org/conferences/?conf=bx2019 A sample LaTeX file using the above style (along with an included sample image) can be downloaded at - http://ceur-ws.org/Vol-XXX/samplestyles/paper1p.tex - http://ceur-ws.org/Vol-XXX/samplestyles/fig1.eps Five categories of submissions are considered: * Full Research Papers (up to 15 pages) - in-depth presentations of novel concepts and results - applications of bx to new domains - survey papers providing novel comparisons between existing bx technologies and approaches case studies * Tool Papers (up to 8 pages) - guideline papers presenting best practices for employing a specific bx approach (with a specific tool) - presentation of new tools or substantial improvements to existing ones - qualitative and/or quantitative comparisons of applying different bx approaches and tools * Experience Report (up to 8 pages) - sharing experiences and lessons learned with bx tools/frameworks/languages - how bx is used in (research/industrial/educational) projects * Extended Abstracts and Short Papers (up to 4 pages) - work in progress - small focused contributions - position papers and research perspectives - critical questions and challenges for bx * Talk Proposals (up to 2 pages) - proposed lectures about topics of interest for bx - existing work representing relevant contributions for bx - promising contributions that are not mature enough to be proposed as papers of the other categories If your submission is not a Full Research Paper, please include the intended submission category in the Title field of EasyChair’s submission form. The bibliography is excluded from the page limits. All papers are expected to be self-contained and well-written. Tool papers are not expected to present novel scientific results, but to document artifacts of interest and share bx experience/best practices with the community. Experience papers are expected to report on lessons learnt from applying bx approaches, languages, tools, and theories to practical application case studies. Extended abstracts should primarily provoke interesting discussion at the workshop and will not be held to the same standard of maturity as regular papers; short papers contain focused results, positions or perspectives that can be presented in full in just a few pages, and that correspondingly contain fewer results and that therefore might not be competitive in the full paper category. Talk proposals are expected to present work that is of particular interest to the community and worth a talk slot at the workshop. We strongly encourage authors to ensure that any (variants of) examples are present in the bx example repository at the time of submission, and for tool papers, to allow for reproducibility with minimal effort, either via a virtual machine (e.g., via Share - http://share20.eu) or a dedicated website with relevant artifacts and tool access. All papers will be peer-reviewed by at least three members of the program committee. If a paper is accepted, one author of the paper is expected to participate in the workshop to present it. Authors of accepted tool papers are also expected to be available to demonstrate their tool at the event. Proceedings and Special Issue ============================= The workshop proceedings, including all accepted papers (except talk proposals), will be published electronically by CEUR-WS.org. A special issue open to all authors of papers in BX workshops over the past few years is planned. Program committee ================= * Co-chairs - James Cheney, University of Edinburgh, UK - Hsiang-Shang ‘Josh’ Ko, National Institute of Informatics, Japan * Members - Leopoldo Bertossi, Carleton University, Canada - Ravi Chugh, University of Chicago, US - Zinovy Diskin, McMaster University, Canada - Paolo Guagliardo, University of Edinburgh, UK - Jules Hedges, University of Oxford, UK - Michael Johnson, Macquarie University, Australia - Leen Lambers, Hasso Plattner Institute, University of Potsdam, Germany - Kazutaka Matsuda, Tohoku University, Japan - Anders Miltner, Princeton University, US - Alfonso Pierantonio, University of L'Aquila, Italy - Perdita Stevens, University of Edinburgh, UK - Daniel Strüber, University of Koblenz and Landau, Germany - Manuel Wimmer, Vienna University of Technology, Austria - Nicolas Wu, University of Bristol, UK

1 0

[ポスター発表募集] 第21回プログラミングおよびプログラミング言語ワークショップ (PPL 2019)
by Kohei SUENAGA 29 Jan '19

29 Jan '19

皆様第21回プログラミングおよびプログラミング言語ワークショップ (PPL 2019) のプログラム共同委員長を仰せつかっております京大の末永とクックパッドの笹田です。下記の通り、ポスター発表の締め切りが「2019年2月6日 (水) 17:00 (JST)」と迫ってきましたので、ご連絡いたします。重複してお受け取りになりましたらご容赦ください。募集要項には「2時間程度のセッション内でのポスター発表またはデモ発表」とありますが、例年発表が多い割に時間が短い、というご意見もあったため、時間の延長を検討しております。カテゴリ1などの発表でご応募頂いた皆様にも、ぜひポスターで議論を深めて頂くため、ポスターにもご応募頂けますと幸いです。以上、よろしくお願いします。 On 2018/11/26 10:09, Kohei SUENAGA wrote: > PPL 2019 は 2019年3月6日 (水)～3月8日 (金) の日程で > 岩手県志戸平温泉で開催されます．実装系理論系問わず > プログラミングやプログラミング言語に関する研究をされている方は > どうぞ論文の投稿をご検討ください． > > 国内外未発表論文を募集するカテゴリ1については > 発表申込締切: 2019年12月21日 (金) 17:00 (JST) > 論文提出締切: 2019年1月7日 (月) 17:00 (JST) > となっております． > > 本年は以下の二名の方の招待講演を予定しております． > 萩谷昌己（東京大学） > 植山類（Google） ... > カテゴリ3 (ポスター・デモ発表) > ------------------------------ > 2時間程度のセッション内でのポスター発表またはデモ発表です．既発表・未発 > 表の別を問いません．PPLへの関連をもとに採否を判定いたしますが，申し込 > み多数の場合はプログラム委員会で選考致します． > > 発表申込締切: 2019年2月6日 (水) 17:00 (JST) > 採否通知：2019年2月11日 (月) -- Kohei Suenaga (末永幸平), Ph.D Associate professor (准教授) Graduate School of Informatics, Kyoto University (京都大学情報学研究科) ksuenaga(a)gmail.com http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/

1 0

JAIST Logic Seminar Series
by Hajime Ishihara 25 Jan '19

25 Jan '19

皆様 LMUミュンヘンのHelmut Schwichtenberg先生の講演のお知らせです。どうぞふるってご参加ください。問合せ先：石原　哉北陸先端科学技術大学院大学情報科学系 e-mail: ishihara(a)jaist.ac.jp ----------------------------------------------- * JAIST Logic Seminar Series * * The seminar below is held as a part of JSPS Core-to-Core Program, A. Advanced Research Networks and EU Horizon 2020 Marie Skłodowska-Curie actions RISE project CID (http://www.jaist.ac.jp/logic/ja/core2core, http://cid.uni-trier.de/). Date: Wednesday 6 March, 2019, 15:20-17:00 Place: JAIST, Collaboration room 7 (I-56) (Access: http://www.jaist.ac.jp/english/location/access.html) Speaker: Professor Helmut Schwichtenberg (Mathematisches Institut, LMU Muenchen) Title: Equality and extensionality Abstract: We sketch a theory of computable functionals (TCF) based on finitary algebras given by their constructors. Its intended semantics admits non-total functionals. For closed algebras of level zero we allow infinite stream-like objects. For higher types we define (pointwise) equality as a logical relation, and extensionality by diagonalization of equality. We define realizability and -- in the spirit of Kolmogorov (1932) -- add an invariance axiom: every computationally relevant (c.r.) formula A is equivalent to the existence of an extensional realizer of A. Then we can prove (ordinary and dependent) choice, and also a soundness theorem stating that the computational content extracted from a proof of a c.r. formula A realizes A.

1 0

RIMS
by arai toshiyasu 24 Jan '19

24 Jan '19

みなさま新井@千葉大です。既にご存知の方もいらっしゃると思いますが念のためお知らせします。 RIMS は昨年11月に共（同利用）・共（同研究）拠点から国際共・共拠点に衣替えしました。それに伴う拠点事業の変更の要点は： (1) 従来の拠点事業　プロジェクト研究　RIMS共同研究（公開型）　RIMS共同研究（グループ型）　RIMS合宿型セミナー　長期研究員を以下に再編する：　訪問滞在型研究（プロジェクト研究の拡大版）　RIMS共同研究（公開型）　RIMS共同研究（グループ型A, グループ型B[新規], グループ型C[新規]）　RIMS合宿型セミナー　RIMS総合研究セミナー[新規] 　長期研究員　プロジェクトフェロー[新規] 4つの[新規],は　グループ型Bは、数名による国際共同研究　グループ型Cは、外国人のみによる共同研究　総合研究セミナーは、研究者向けのチュートリアル　プロジェクトフェローは、訪問滞在型研究の　企画実施支援のために雇用されるPD (2) 上記の拠点事業の内、長期研究員とプロジェクトフェロー以外を国際公募とし、事業費による海外からの研究者の渡航費支払いを認める。 (3) グループ型Bに機動性を持たせるために、通年募集とし年3回の締切と採択を行う。詳細はRIMSのページ　http://www.kurims.kyoto-u.ac.jp/kyoten/ja/index.html でご確認下さい。尚、今年度内の追加募集も始まっています。以上、報告まで -- 新井敏康

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

Logic-ml