All decks Close
All decks 36

  • 컴파일러 이야기 GCC와 LLVM

    Dec 01, 2021 617 0

  • DoMoreWithLet

    HNU CE 프로그래밍언어론 (2021년 1학기)

    May 17, 2021 767 0

  • 수학과

    May 14, 2021 770 0

  • 함수

    HNU CE 프로그래밍언어론 (2021년 1학기)

    Apr 14, 2021 823 0

  • 변수와 유효범위

    HNU CE 프로그래밍언어론 (2021년 1학기)

    Apr 14, 2021 696 0

  • 논리식 산술식 모두 포함된 언어

    HNU CE 프로그래밍언어론 (2021년 1학기)

    Apr 13, 2021 575 0

  • 무지 단순한 산술식 언어

    HNU CE 프로그래밍언어론 (2021년 1학기)

    Apr 12, 2021 527 0

  • A Prolog Specifiation of Extensible Records

    Nov 24, 2016 3,270 0

  • 컴퓨터아키텍처

    2016-06-01

    Jun 01, 2016 1,657 0

  • 컴퓨터아키텍처

    2016-05-19

    May 19, 2016 1,980 0

  • 데이타구조

    2016-05-03

    May 02, 2016 1,987 0

  • 컴퓨터아키텍처

    2016-04-28

    Apr 27, 2016 2,011 0

  • 컴퓨터아키텍처

    2016-04-27

    Apr 27, 2016 1,561 0

  • 데이타구조

    2016-04-19

    Apr 18, 2016 1,919 1

  • 컴퓨터아키텍처

    2016-04-07

    Apr 14, 2016 1,518 0

  • 컴퓨터아키텍처

    2016-04-14

    Apr 14, 2016 1,727 0

  • 데이타구조

    2016-04-12

    Apr 11, 2016 1,547 0

  • 컴퓨터아키텍처

    2016-04-07

    Apr 07, 2016 1,858 0

  • 컴퓨터아키텍처

    2016-04-06

    Apr 06, 2016 1,807 0

  • 컴퓨터아키텍처

    2016-03-30

    Mar 30, 2016 2,767 0

  • 데이타구조

    2016-03-29

    Mar 28, 2016 1,564 0

  • 데이타구조

    2016-03-25

    Mar 24, 2016 1,734 0

  • 컴퓨터아키텍처

    2016-03-24

    Mar 23, 2016 1,755 0

  • 컴퓨터아키텍처

    2016-03-23

    Mar 23, 2016 2,001 0

  • 데이타구조

    2016-03-22

    Mar 21, 2016 1,772 0

  • 컴퓨터아키텍처

    2016-03-17

    Mar 17, 2016 1,699 0

  • 컴퓨터아키텍처

    2016-03-16

    Mar 16, 2016 2,270 0

  • 데이타구조

    2016-03-15

    Mar 14, 2016 1,907 2

  • 컴퓨터아키텍처

    2016-03-10

    Mar 10, 2016 2,088 0

  • 컴퓨터아키텍처

    2016-03-09

    Mar 09, 2016 1,879 1

  • 데이타구조

    2016-03-08

    Mar 07, 2016 1,849 1

  • Executable Relational Specifications of Polymorphic Type Systems using Prolog

    Talk slides for FLOPS 2016

    Mar 03, 2016 2,409 1

  • Type Inference Prototyping Engines from Relational specifications of type systems

    A declarative and machine executable specification of the Hindley–Milner type system (HM) can be formulated using a Logic Programming (LP) language such as Prolog. Modern functional language implementations such as the GHC supports more advanced polymorphism beyond HM. We introduce the plans and progress of the TIPER project to push this idea of using LP for type system specification further towards a more practical language design/implementation tool. (Note: This is a milestone talk slide for a KIISE/SIGPL winter workshop 2016.)

    Feb 25, 2016 1,697 0

  • Type Inference Prototyping Engines from Relational specifications of type systems

    A declarative and machine executable specification of the Hindley–Milner type system (HM) can be formulated using a Logic Programming (LP) language such as Prolog. Modern functional language implementations such as the GHC supports more advanced polymorphism beyond HM. We introduce the plans and progress of the TIPER project to push this idea of using LP for type system specification further towards a more practical language design/implementation tool. (Note: This is a milestone talk slide for a KIISE/SIGPL winter workshop 2016.)

    Feb 10, 2016 2,227 0

  • Executable Relational Specifications of Polymorphic Type Systems using Logic Programming

    A declarative and machine executable specification of the Hindley–Milner type system (HM) can be formulated using a logic programming language. Modern functional language implementations such as the GHC supports more advanced polymorphism beyond HM. We progressively extended the HM specification to include more features using Prolog. We will contemplate on the lessons from this case study and introduce the plans and progress of the TIPER project to push this idea further towards a more practical language design/implementation tool.

    Jan 06, 2016 2,452 0

  • Executable Relational Specifications of Polymorphic Type Systems using Prolog

    Talk @ Dundee, UK 2015-08-28

    Aug 27, 2015 2,924 0