Term Rewriting and Lambda Calculus

被引:0
|
作者
Klop, Jan Willem [1 ]
机构
[1] Vrije Univ Amsterdam, Amsterdam, Netherlands
来源
2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) | 2012年
关键词
D O I
10.1109/LICS.2012.12
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:12 / 12
页数:1
相关论文
共 50 条
  • [1] Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus
    Grathwohl, Niels Bjorn Bugge
    Ketema, Jeroen
    Pallesen, Jens Duelund
    Simonsen, Jakob Grue
    22ND INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'11), 2011, 10 : 61 - 70
  • [3] Highlights in infinitary rewriting and lambda calculus
    Endrullis, Jorg
    Hendriks, Dimitri
    Klop, Jan Willem
    THEORETICAL COMPUTER SCIENCE, 2012, 464 : 48 - 71
  • [4] ADDING ALGEBRAIC REWRITING TO THE UNTYPED LAMBDA CALCULUS
    DOUGHERTY, DJ
    INFORMATION AND COMPUTATION, 1992, 101 (02) : 251 - 267
  • [5] Rewriting with extensional polymorphic lambda-calculus
    DiCosmo, R
    Kesner, D
    COMPUTER SCIENCE LOGIC, 1996, 1092 : 215 - 232
  • [6] On the confluence of lambda-calculus with conditional rewriting
    Blanqui, Frederic
    Kirchner, Claude
    Riba, Colin
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (37) : 3301 - 3327
  • [7] Term graph rewriting for the π-calculus
    Gadducci, F
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2003, 2895 : 37 - 54
  • [8] Encoding the pure lambda calculus into hierarchical graph rewriting
    Ueda, Kazunori
    REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2008, 5117 : 392 - 408
  • [9] Rewriting Modulo beta in the lambda Pi-Calculus Modulo
    Saillard, Ronan
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2015, (185): : 87 - 101
  • [10] Confluence via strong normalisation in an algebraic lambda-calculus with rewriting
    Buiras, Pablo
    Diaz-Caro, Alejandro
    Jaskelioff, Mauro
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (81): : 16 - 29