|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SS |
2007-06-22 09:30 |
Ishikawa |
JAIST |
Static Dependeycy Pair Method for Proving Termination of Higher-Order Rewriting Systems Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) SS2007-12 |
A higher-order rewriting systems (HRS) is a computational model that provides operational semantics for functional progr... [more] |
SS2007-12 pp.17-22 |
SS |
2007-06-22 10:10 |
Ishikawa |
JAIST |
Argument Filtering Method on Second-Order Rewriting System Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) SS2007-13 |
Higher-order rewrite systems are computation models of functional programming languages, and the termination property is... [more] |
SS2007-13 pp.23-28 |
SS |
2006-04-20 16:10 |
Niigata |
Niigata Univ., Igarashi Campus |
Proving Termination of Higher-Order Rewrite Systems based on Strongly Computable Dependency Pair Method Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) |
The higher-order rewrite systems (HRS for short) are a computation model of functional programming languages, and hence ... [more] |
SS2006-6 pp.31-36 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|