You are here: Home / File Collection / Ida / Publications of SCORE (Symbolic Computation Research Group)

Publications of SCORE (Symbolic Computation Research Group)

This page contains the list of the publications of SCORE. Each bibliographical items are sorted by year and author (1977 - 2011) Note that most of the links to the original source pdf files are broken, as the server www.score.cs.tsukuba.ac.jp is not maintained. Most of the source files can be found either at ResearchGate (www.researchgate.net) or from each authors's home page.

 

Ghourabi, F, Ida, T, and Kasem, A (2011).
Proof Documents for Automated Origami Theorem Proving
In: Automated Deduction in Geometry. Electronic Notes in Theoretical Computer Science, edited by Pascal Schreck, Julien Narboux and Jürgen Richter-Gebert. Springer-Verlag, pages 78-97.

 

Ida, T, Kasem, A, Ghourabi, F, and Takahashi, H (2011).
Morley's Theorem Revisited: Origami Construction and Automated Proof
Journal of Symbolic Computation 46(5):571– 583.

 

Kaliszyk, C and Barendregt, H (2011).
Reasoning about Constants in Nominal Isabelle
In: Proc. of the First International Conference on Certified Programs and Proofs (CPP'11), edited by Jean-Pierre Jouannaud and Zhong Shao. Springer Verlag, pages 87--102.

 

Kaliszyk, C and Ida, T (2011).
Proof Assistant Decision Procedures for Formalizing Origami
In: Proc. of the 18th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning (Calculemus'11), edited by James H. Davenport and William M. Farmer and Josef Urban and Florian Rabe. Springer Verlag, pages 45--57.

 

Kaliszyk, C and Urban, C (2011).
Quotients revisited for Isabelle/HOL
In: Proc. of the 26th ACM Symposium on Applied Computing (SAC'11), edited by William C. Chu and W. Eric Wong and Mathew J. Palakal and Chih-Cheng Hung. ACM, pages 1639--1644.

 

Kasem, A, Ghourabi, F, and Ida, T (2011).
Origami Axioms and Circle Extension
In: Proceedings of the 26th Symposium on Applied Computing (SAC 2011), edited by Dongwan Shin. ACM, pages 1106--1111.

 

Marin, M and Kutsia, T (2011).
Type Inference for Regular Expression Pattern Matching
In: 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, edited by Tetsuo Ida, Viorel Negru, Tudor Jebelean, Dana Petcu, Stephen Watt, Daniela Zaharie. IEEE Computer Society, pages 366--375.

 

Dundua, B, Kutsia, T, and Marin, M (2010).
Strategies in PρLog
In: 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'09), edited by Maribel Fernandez. Electronic Proceedings in Theoretical Computer Science, 15, pages 32-43.

 

Ida, T and Takahashi, H (2010).
Origami Fold as Algebraic Graph Rewriting
Journal of Symbolic Computation 45(4):393--413.

 

Kasem, A and Ida, T (2010).
Extended Web Services for Computational Origami
In: Proceedings of the Austrian-Japanese Workshop on Symbolic Computation in Software Science (SCSS 2010). RISC, Hagenberg, Austria.

 

Kutsia, T and Marin, M (2010).
Order-Sorted Unification with Regular Expression Sorts
In: Proceedings of 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Edinburgh, UK, edited by Christopher Lynch. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pages 193-208.

 

Marin, M and Craciun, A (2010).
Factorizations of Regular Hedge Languages
In: Proceedings of 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009), edited by Stephen Watt, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Daniela Zaharie. IEEE Computer Society Order Number P3964, Timisoara, pages 307-314.

 

Marin, M and Kutsia, T (2010).
On the Computation of Quotients and Factors of Regular Language
Frontiers of Computer Science in China 4(2):173-184.

 

Marin, M and Kutsia, T (2010).
Linear Systems for Regular Hedge Languages
In: Advances in Databases and Information Systems. Associated Workshops and Doctoral Consortium of the 13th East-European Conference, ADBIS 2009. Proceedings. LNCS 5968, edited by Janis Grundspenkis, Marite Kirikova, Yannis Manolopoulos, Leonids Novickis. Springer, Riga, Latvia, pages 104-112.

 

Marin, M and Kutsia, T (2010).
Regular Hedge Language Factorization Revisited
In: Proceedings of 14th Developments in Language Theory (DLT 2010), LNCS, edited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu. Springer, London, Ontario, Canada, pages 328-339.

 

Ghourabi, F, Ida, T, and Wang, D (2009).
Theorem Proving Based on the Characteristic Set Method for Computational Origami Constructions
In: Proceedings of the Tunisia - Japan Workshop on Symbolic Computation in Software Science (SCSS 2009), edited by A. Bouhoula and T. Ida. EasyChair, Gammarth, Tunisia, pages 90-92.

 

Ghourabi, F, Ida, T, Takahashi, H, and Kasem, A (2009).
Reasoning Tool for Mathematical Origami Construction
In: ISSAC09 Software Presentation. ACM.

 

Ida, T (2009).
Graph Rewriting in Computational Origami
In: Proceedings of the 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2008), edited by Viorel Negru, Tudor Jebelean, Dana Petcu and Daniela Zaharie. IEEE, pages 20--27.

 

Ida, T (2009).
Symbolic and Algebraic Methods in Computational Origami
In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, edited by John P. May. Association for Computing Machinery, pages 3--4.

 

Ida, T and Takahashi, H (2009).
Origami Fold as Algebraic Graph Rewriting
In: Proceedings of the 24th annual ACM, Symposium on Applied Computing (SAC 2009). ACM, pages 1132--1138.

 

Ida, T, Takahashi, H, Marin, M, Kasem, A, and Ghourabi, F (2009).
Computational Origami System Eos
In: Origami4 Fourth International Meeting of Origami, Science, Mathematics, and Education, edited by Robert J. Lang. A K Peters, Ltd., Natick, Massachusetts, pages 285--293.

 

Kutsia, T and Marin, M (2009).
Matching of Order-Sorted Terms with Regular Expression Sorts and Second-Order Variables
In: Proceedings of Tunisia-Japan Workshop on Symbolic Computation in Software Science (SCSS 2009). EasyChair, Gammarth, Tunisia.

 

Kutsia, T and Marin, M (2009).
Order-Sorted Unification with Regular Expression Sorts
In: 23rd International Meeting on Unification (UNIF 2009), edited by Christopher Lynch, Paliath Narendran. Informal proceedings, Montreal, Canada.

 

Marin, M and Kutsia, T (2009).
On the Computation of Quotients and Factors of Regular Languages
In: Proceedings of the Sixth Asian Workshop on Foundations of Software , edited by Zhenjiang Hu and Jian Zhang. National Institute of Informatics, Tokyo, Japan, pages 67-78.

 

Marin, M and Kutsia, T (2009).
Computational Methods in an Algebra of Regular Hedge Expressions
RISC-Linz, RISC Report Series(09-03), Schloss Hagenberg.

 

Bottom of Form

Tozawa, A, Tatsubori, M, Onodera, T, and Minamide, Y (2009).
Copy-on-write in the PHP language
In: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages . ACM, pages 200--212 .

 

Ghourabi, F, Ida, T, and Takahashi, H (2008).
Computational Origami of Angle Quintisection
In: Proceedings of the Annual Symposium of Japan Society for Software Science and Technology (JSSST 2008). JSSST.

 

Ghourabi, F, Ida, T, and Takahashi, H (2008).
Computational Origami of Angle Quintisection
In: Proceedings of the Austrian-Japanese Workshop on Symbolic Computation in Software Science (SCSS 2008). RISC, Hagenberg, Austria, pages 57--68.

 

Ida, T and Kasem, A (2008).
WEBEOS: A System for Origami Construction and Proving on the Web
The INTERNATIONAL INSTITUTE for ADVANCED STUDIES in SYSTEMS RESEARCH and CYBERNETICS, Tecumseh, Canada (ISBN: 978-1-897233-61-0).

 

Ida, T and Takahashi, H (2008).
Graph Rewriting in Computational Origami
In: Proceedings of the Austrian-Japanese Workshop on Symbolic Computation in Software Science (SCSS 2008). RISC, Hagenberg, Austria, pages 69--80.

 

Ida, T, Marin, M, Takahashi, H, and Ghourabi, F (2008).
Computational Origami Construction as Constraint Solving and Rewriting
Electronic Notes in Theoretical Computer Science 6877:31--44.

 

Kasem, A and Ida, T (2008).
Experiences with Web Environment Origamium
In: Proceedings of the Annual Symposium of Japan Society for Software Science and Technology. JSSST, Tokyo, Japan.

 

Kasem, A and Ida, T (2008).
Computational Origami Environment on the Web
Frontiers of Computer Science in China 2(1):39-54.

 

Kasem, A and Ida, T (2008).
Experiences with Web Environment Origamium: Examples and Applications
In: Proceedings of the Austrian-Japanese Workshop on Symbolic Computation in Software Science (SCSS 2008). RISC, Hagenberg, Austria, pages 109 - 122.

 

Marin, M (2008).
22nd International Workshop on Unification
RISC-Linz, Workshop proceedings(08-11), Schloss Hagenberg, Austria.

 

Marin, M and Kutsia, T (2008).
Matching with Membership Constraints for Hedge and Context Variables
In: Proceedings of 22nd International Workshop on Unification (UNIF 2008), edited by Mircea Marin. RISC-Linz, Schloss Hagenberg, pages 55-68.

 

松本宗太郎 and 南出靖彦 (2008).
多相レコード型に基づくRubyプログラムの型推論
情報処理学会論文誌:プログラミング 49(SIG 3):39--54.

 

高橋 英和 and 井田 哲雄 (2008).
グラフ書換による計算折り紙のモデル化と実現
In: Proceedings of the Annual Symposium of Japan Society for Software Science and Technology (JSSST 2008). JSSST.

 

Ghourabi, F, Ida, T, Takahashi, H, Marin, M, and Kasem, A (2007).
Logical and Algebraic View of Huzita's Origami Axioms with Applications to Computational Origami
In: Proceedings of the 22nd ACM Symposium on Applied Computing. ACM Press, pages 767-772.

 

Ghourabi, F, Takahashi, H, and Ida, T (2007).
Analysis of Layers of Faces in Computational Origami Modeling
Proceedings of the Annual Symposium of Japan Society for Software Science and Technology. JSSST, Nara, Japan.

 

Ida, T (2007).
Modeling Origami and Beyond
In: Proceedings of SYNASC 2007, 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. Institute e-Austria, Timisoara, pages 13.

 

Ida, T, Marin, M, Takahashi, H, and Ghourabi, F (2007).
Computational Origami Construction as Constraint Solving and Rewriting
In: 16th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2007). R. Echahed, pages 139-152.

 

Ida, T, Takahashi, H, Marin, M, and Ghourabi, F (2007).
Modelling Origami for Computational Construction and Beyond
International Conference on Computational Science and Its Applications 2007 (ICCSA 2007) Lecture Notes in Computer Science(4706):653 -- 665.

 

Kasem, A, Takahashi, H, Marin, M, and Ida, T (2007).
webOrigami2 : A System for Origami Construction and Proving Using Web 2.0 Technologies
In: Proceedings of the Annual Symposium of Japan Society for Software Science and Technology. JSSST, Nara, Japan.

 

Kutsia, T and Marin, M (2007).
Austria-Japan Workshop on Symbolic Computation and Software Verification
Johannes Kepler University of Linz, Austria, RISC Report Series(07-09), Schloss Hagenberg.

 

Minamide, Y (2007).
Verified Decision Procedures on Context-Free Grammars
In: Proc. of the 20th International Conference on Theorem Proving in Higher Order Logics. Springer, LNCS 4732, pages 173--188.

 

Naifer, M, Kasem, A, and Ida, T (2007).
A System of Web Services for Symbolic Computation
In: Proceedings of the 5th Asian Workshop on Foundations of Software, edited by Tetsuo Ida, Qingshan Jiang, and Dongming Wang. Beihang University, pages 145--152.

 

Tozawa, A and Minamide, Y (2007).
Complexity Results on Balanced Context-Free Languages
In: Proc. of the Tenth International Conference on Foundations of Software Science and Computation Structures. Springer, pages 346--360.

 

南出靖彦 (2007).
Cプログラムの検証ツール Caduceus(ソフトウェア紹介)
コンピュータソフトウェア 24(3):15--19.

 

Calmet, J, Ida, T, and Wang, D (2006).
Artificial Intelligence and Symbolic Computation, 8th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2006)
Springer.

 

Ghourabi, F, Ida, T, Takahashi, H, Marin, M, and Kasem, A (2006).
Logical and Algebraic Formulation of Origami Axioms
In: Proceedings of the Annual Symposium of Japan Society for Software Science and Technology. JSSST, Tokyo, Japan.

 

Ida, T (2006).
Tiers of webOrigami Programming
In: Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. (SYNASC 2006), pages 4.

 

Ida, T (2006).
Logic, Geometry and Algebra in Computational Origami
In: Thailand International Conference on 21st Century Information Technology in Mathematical Education (ICITM 2006), edited by Gullaya Dhompongsa, Faqir M. Bhatti and Quentin C. Kitson . Chiang Mai Rajabhat University.

 

Ida, T, Takahashi, H, Marin, M, Kasem, A, and Ghourabi, F (2006).
Computational Construction of a Maximal Equilateral Triangle Inscribed in an Origami
In: Proceedings of Second International Congress on Mathematical Software, LNCS 4151, edited by Andres Iglesias, Nobuki Takayama. Springer, pages 361--372.

 

Kasem, A, Ida, T, Takahashi, H, Marin, M, and Ghourabi, F (2006).
E-Origami System Eos
In: Proceedings of the Annual Symposium of Japan Society for Software Science and Technology. JSSST, Tokyo, Japan.

 

Kutsia, T and Marin, M (2006).
Solving Regular Constraints for Hedges and Contexts
In: Proceedings of the 20th International Workshop on Unification, edited by Jordi Levy. Workshop hardcopy, pages 89--107.

 

Marin, M and Ida, T (2006).
Progress of ρLog, a rule-based programming system
Mathematica in Education and Research 11(1):50--66.

 

Marin, M and Kutsia, T (2006).
Foundations of the Rule-Based System ρLog
Journal of Applied Non-Classical Logic 16(1--2):151--168.

 

Minamide, Y and Tozawa, A (2006).
XML Validation for Context-Free Grammars
In: Proc. of The Fourth ASIAN Symposium on Programming Languages and Systems. Springer, pages 357-373.

 

Robu, J, Ida, T, Tepeneu, D, Takahashi, H, and Buchberger, B (2006).
Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness
In: Lecture Notes in Computer Science 3763. Springer, pages 19-33.

 

井田, � and 浜名, � (2006).
計算モデル論入門 ーチューリング機械からラムダ計算へー
サイエンス社(ISBN: ISBN4-7819-1135-8.).

 

Ida, T, Marin, M, and Takahashi, H (2005).
Computational Origami of a Morley's Triangle
In: Proceedings of 4th International Conference on Mathematical Knowledge Management (MKM 2005), LNCS 3863, edited by Michael Kohlhase. Springer, pages 267--282.

 

Ida, T, Takahashi, H, Tepeneu, D, and Marin, M (2005).
Morley's Theorem Revisited through Computational Origami
In: Proceedings of 7th International Mathematica Symposium (IMS 2005). CD version.

 

Kobayashi, N, Marin, M, Tanaka, Y, and Urushihara, H (2005).
On the Development of an Analysis System for Upstream Sequences in Dictyostelium discoideum Genome
Computer Software 22(3):167--172.

 

Kutsia, T and Marin, M (2005).
Can Context Sequence Matching be used for XML Querying?
In: Proceedings of the 19th International Workshop on Unification, edited by Laurent Vigneron. Workshop hardcopy, Nara, Japan.

 

Kutsia, T and Marin, M (2005).
Matching with Regular Constraints
In: Proceedings of the 12th International Conference on Logic, Programming, Artificial Intelligence and Reasoning (LPAR 2005), LNAI 3835, edited by Geoff Sutcliffe, Andrei Voronkov. Springer, pages 215-229.

 

Kutsia, T and Marin, M (2005).
Matching with Regular Constraints
Institute RISC-Linz, Technical Report (05-05), Schloss Hagenberg, Austria.

 

Kutsia, T and Marin, M (2005).
Matching with Regular Constraints
In: Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05), edited by Geoff Sutcliffe and Andrei Voronkov. Springer Verlag, Jamaica, chapter 3835, pages 215--229.

 

Marin, M and Ida, T (2005).
Progress of ρLog, a rule-based programming system
In: eProceedings of 7th International Mathematica Symposium (IMS 2005). CD proceedings version.

 

Marin, M and Ida, T (2005).
A Rule-based Framework for Automated Reasoning
In: Proceedings of the 7th Asian Symposium on Computer Mathematics (ASCM 2005), edited by Sung-il Pae, Hyungju Park. KIAS, Korea, pages 28--31.

 

Marin, M and Ida, T (2005).
Rule-based Programming with ρLog
In: 7th international Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE Computer Society.

 

Minamide, Y (2005).
Static Approximation of Dynamically Generated Web Pages
In: Proc. of the 14th International World Wide Web Conference. ACM, pages 432-441.

 

Ida, T and Buchberger, B (2004).
Computational Origami: Interaction of Solving, Proving and Computing
In: World Conference on 21st Century Mathematics 2004. GC University, pages 37--51.

 

Ida, T, Tepeneu, D, Buchberger, B, and Robu, J (2004).
Proving and Constraint Solving in Computational Origami
In: Proceeding of the 7th International Symposium on Artificial Intelligence and Symbolic Computation (AISC). Springer, pages 132--142.

 

Kobayashi, N, Marin, M, Morio, T, Tanaka, Y, and Urushihara, H (2004).
An analysis of upstream sequences of Dictyostelium discoideum using a distributed computer system
Miscellaneous publication.

 

Kutsia, T and Marin, M (2004).
Unification Procedure for Terms with Sequence Variables and Sequence Functions
In: Proceedings of the 18th International Workshop on Unification (UNIF'04). UNIF series preprint.

 

Marin, M and Dragan, M (2004).
A Jini Service for Collaborative Constraint Solving
In: Proceedings of International Conference on Computers and Communications (ICCC 2004). Editura Universitatii din Oradea , pages 235--240.

 

Marin, M and Kutsia, T (2004).
A Rule-based Approach to the Implementation of Evaluation Strategies
In: Proceedings of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2004), edited by Tudor Jebelean, Viorel Negru, Adriana Popovici. Analele Universitatii de Vest din Timisoara, Timisoara, pages 117--134.

 

Marin, M and Middeldorp, A (2004).
New Completeness Results for Lazy Conditional Narrowing
In: Proceedings of the 6th ACM-SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2004). ACM Press, pages 120--131.

 

Marin, M and Piroi, F (2004).
Deduction and Presentation in ρLog
ENTCS 93:161--182.

 

Takahashi, H, Tepeneu, D, and Ida, T (2004).
A System for Computational Origami-Progress Report
In: Proceedings of the 6th International Mathematica Symposium (IMS). Positive Corporation, Hampshire, England.

 

Tepeneu, D and Ida, T (2004).
MathGridLink-Connecting Mathematica to "the Grid"
In: Proceedings of the 6th International Mathematica Symposium (IMS). Positive Corporation, Hampshire, England.

 

Ida, T and Marin, M (2003).
Functional Logic Origami Programming with Open CFLP
In: Challenging the Boundaries of Symbolic Computation. Proceedings of 5th International Mathematica Symposium (IMS 2003), edited by Peter Mitic, Philip Ramsden, Janet Carne. Imperial College Press, pages 397--404.

Ida, T, Marin, M, and Takahashi, H (2003).
Constraint Functional Logic Programming for Origami Construction
In: Proceedings of the First Asian Symposium on Programming Languages and Systems (APLAS 2003), LNCS 2895. Springer, pages 73--88.

 

Kobayashi, N, Marin, M, and Ida, T (2003).
Collaborative Constraint Functional Logic Programming System in an Open Environment
IEICE Transactions on Information and Systems E86-D(1):63--70.

 

Kobayashi, N, Marin, M, and Ida, T (2003).
A Web Oriented System for Equational Solving
In: Proceedings of 12th International Workshop on Functional and (Constraint) Logic Programming. University of Valencia, Valencia, Spain, pages 309--312.

 

Marin, M (2003).
Functional Programming with Sequence Variables: The Sequentica Package
In: 17th International Workshop on Unification (UNIF'2003). University of Valencia, Valencia, Spain, pages pp. 65--78.

 

Marin, M and Kutsia, T (2003).
On the Implementation of a Rule-Based Programming System and some of its Applications
In: Proceedings of the 4th International Workshop on the Implementation of Logics (WIL 2003), edited by Boris Konev, Renate Schmidt. University of Liverpool, Almaty, Kazakhstan.

 

Marin, M and Kutsia, T (2003).
Programming with Transformation Rules
In: Proceedings of the 5th International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2003). Universitatea Timisoara, pages 157--167.

 

Marin, M and Piroi, F (2003).
Rule-based Deduction and Views in Mathematica
Johann Radon Institute for Computational And Applied Mathematics (RICAM), SFB Report (2003-43), Altenberger Strasse 69, Linz, Austria.

 

Marin, M and Tepeneu, D (2003).
Programming with Sequence Variables: the Sequentica package
In: Challenging the Boundaries of Symbolic Computation. Proceedings of 5th International Mathematica Symposium (IMS'2003), edited by Peter Mitic, Philip Ramsden, Janet Carne. Imperial College Press, pages 17--24.

 

Minamide, Y (2003).
Selective Tail Call Elimination
In: Proc. of 10th Annual International Static Analysis Symposium. Springer, pages 153-170.

 

Minamide, Y and Okuma, K (2003).
Verifying CPS Transformations in Isabelle/HOL
In: Proc. of the The Second Workshop on Mechanized Reasoning about Languages with Variable Binding. ACM.

 

Okuma, K and Minamide, Y (2003).
Executing Verified Compiler Specification
In: Proc. of the First Asian Symposium on Programming Languages and Systems. Springer, pages 178-194.

 

Takahashi, H and Ida, T (2003).
Origami Programming Environment, Challenging the Boundaries of Symbolic Computation
In: Proceeding of the 5th International Mathematica Symposium (IMS). Imperial College Press, pages 413--420.

 

Ida, T, Marin, M, and Suzuki, T (2002).
Reducing Search Space in Solving Higher-Order Equations
In: Progress in Discovery Science, Final Report of the Japanese Discovery Science Project, LNCS 2281, edited by Setsuo Arikawa, Ayumi Shinohara. Springer, pages 19--30.

 

Marin, M and Middeldorp, A (2002).
New Completeness Results for Lazy Conditional Narrowing
In: Sixth International Workshop on Unification (UNIF 2002). UNIF worksop series preprint.

 

Ida, T, Marin, M, and Kobayashi, N (2001).
An Open Environment for Cooperative Equational Solving
Wuhan University Journal of Natural Sciences 6(1-2):169--174.

 

Ida, T, Marin, M, and Suzuki, T (2001).
Higher-order Lazy Narrowing: A Solver for Higher-order Equations
In: Proceedings of the Eight International Conference on Computer Aided Systems. (EUROCAST 2001), LNCS 2178. Springer, pages 478--493.

 

Li, Q, Guo, Y, Darlington, J, and Ida, T (2001).
Minmised Geometric Buchberger Algorithm for Integer Programming
Annals of Operations Research 108:87--109.

 

Marin, M, Ida, T, and Schreiner, W (2001).
CFLP: A Mathematica Implementation of a Distributed Constraint Solving System
The Mathematica Journal 8(2):287--300.

 

Minamide, Y (2001).
Runtime Behavior of Conversion Interpretation of Subtyping
In: Proc. of 13th International Workshop on the Implementation of Functional Languages. Springer, pages 155-167.

 

Ida, T, Marin, M, and Suzuki, T (2000).
Cooperative Constraint Functional Logic Programming
In: Proceeding of the 9th International Workshop on Functional and Logic Programming (WFLP'2000). Springer, pages 382--390.

 

Li, Q, Guo, Y, and Ida, T (2000).
Modelling Integer Programming with Logic: Language and Implementation
IEICE Transactions of Fundamentals of Electronics, Communications and Computer Sciences E83-A(8):1673--1680.

 

Marin, M (2000).
Functional Logic Programming with Distributed Constraint Solving
Phd thesis, RISC-Linz Institute, Johannes Kepler University, Schloss Hagenberg, Austria.

 

Marin, M, Ida, T, and Suzuki, T (2000).
Cooperative Constraint Functional Logic Programming
In: International Symposium on Principles of Software Evolution (ISPSE 2000), edited by Takuya Katayama, Tetsuo Tamai, Naoki Yonezaki. IEEE, pages 223--230.

 

Marin, M, Ida, T, and Suzuki, T (2000).
Higher-order Lazy Narrowing Calculi in Perspective
In: 9th International Workshop on Functional and Logic Programming WFLP'2000. UPV University Press, pages 238--253.

 

Minamide, Y (2000).
A New Criterion for Safe Program Transformations
In: Proc. The Forth International Workshop on Higher Order Operational Techniques in Semantics (HOOTS). Elsevier.

 

Li, Q, Guo, Y, and Ida, T (1999).
Transformation of Logical Specification into IP-formulas
In: Proceeding of the 3rd International Mathematica Symposium (IMS). Computational Mechanics Publications, WIT Press, Southampton, UK.

 

Marin, M, Ida, T, and Schreiner, W (1999).
CFLP: A Mathematica Implementation of a Distributed Constraint Solving System
In: Third International Mathematica Symposium (IMS'99). Computational Mechanics Publications, WIT Press, Southampton, UK.

 

Marin, M, Ida, T, and Schreiner, W (1999).
A Distributed Constraint Solving System for Functional Logic Programming
In: Proceedings of 1999 Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT'99). IEEE, Ulaanbatar, Mongolia, pages 151--155.

 

Marin, M, Ida, T, and Suzuki, T (1999).
On Reducing the Search Space of Higher-order Lazy Narrowing
In: Proceedings of FLOPS'99, LNCS 1722, edited by Aart Middeldorp, Taisuke Sato. Springer, Berlin Heidelberg, pages 319--334.

 

Marin, M, Ida, T, Middeldorp, A, and Yanagi, T (1999).
LNCA: A Lazy Narrowing Calculus for Applicative Term Rewriting Systems
University of Tsukuba, Research report (ISE-TR-99-158), Tsukuba.

 

Minamide, Y (1999).
Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation
In: Proc. The Third International Workshop on Higher Order Operational Techniques in Semantics (HOOTS). Elsevier.

 

Schreiner, W, Danielczyck-Landerl, W, Marin, M, and Stöcher, W (1999).
A Generic Programming Environment for High Performance Mathematical Libraries
In: Proceedings of Workshop on Generic Programming, Castle Dagstuhl, Wadern, Germany. LNCS 1766, edited by Rüdiger Loos, David Musser. Springer, pages 256--267.

 

大崎, �, Middeldorp, A, and 井田, � (1999).
等式付き書換え系における多ソート不変性
コンピュータソフトウエア 16(1):33-45 .

 

Hamada, M and Ida, T (1998).
Deterministic and Non-deterministic Lazy Conditional Narrowing and their Implementations
Transactions of Information Processing Society of Japan 39(3):656--663.

 

Li, Q, Janssen, F, Yang, Z, and Ida, T (1998).
ILIN: An Implementation of the Integer Labeling Algorithm for Integer Programming
IEICE Transactions of Fundamentals of Electronics, Communications and Computer Sciences E81-A(2):304--309.

 

Minamide, Y (1998).
A Functional Represention of Data Structures with a Hole
In: Proc. POPL '98: The 25rd Symposium on Principles of Programming Languages. ACM, pages 75-84.

 

Minamide, Y and Garrigue, J (1998).
On the Runtime Complexity of Type-Directed Unboxing
In: Proc. the third ACM SIGPLAN International Conference on Functional Programming (ICFP). ACM, pages 1-12.

 

Buchberger, B and Marin, M (1997).
Proving By Simplification
Institute RISC-Linz, Proceedings of the First International Theorema Workshop, Castle of Hagenberg, Austria.

 

Buchberger, B, Jebelean, T, Kriftner, F, Marin, M, Tomuta, E, and Vasaru, D (1997).
A Survey on the Theorema Project
In: Proceedings of ISSAC'97, edited by W. Kuechlin. ACM Press, pages 384--391.

 

Ida, T and Nakahara, K (1997).
Leftmost outside-in narrowing calculi
Journal of Functional Programming 7(2):129--161.

 

Li, Q, Guo, Y, Ida, T, and Darlington, J (1997).
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
In: Proceeding of the 1997 International Symposium on Symbolic and Algebraic Computation. ACM Press, pages 331--338.

 

Marin, M (1997).
A Sample CORA Program for Polynomial Computation
Institute RISC-Linz, HPGP Internal Report (97-2), Schloss Hagenberg, Linz, Austria.

 

Suzuki, T, Nakagawa, K, and Ida, T (1997).
Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-order Functional Logic Language,
In: Proceeding of the 6th International Joint Conference, ALP'97 - HOA'97. Springer, Lecture Notes in Computer Science 1298, pages 99--113.

 

Marin, M (1996).
External Representation of Syntax Trees
Institute RISC-Linz, HPGP Internal Report (96-8), Schloss Hagenberg, Austria.

 

Middeldrop, A, Okui, S, and Ida, T (1996).
Lazy Narrowing: Strong Completeness and Eager Variable Elimination
Journal of Theoretical Computer Science 167:95--130.

 

Minamide, Y (1996).
Compilation Based on a Calculus for Explicit Type Passing
In: Proc. Second Fuji International Workshop on Functional and Logic Programming. World Scientific.

 

Minamide, Y, Morrisett, G, and Harper, R (1996).
Typed Closure Conversion
In: Proc. POPL '96: The 23rd Symposium on Principles of Programming Languagesm. ACM, pages 271-283.

 

大崎, �, Middeldorp, A, and 井田, � (1996).
意味ラベリ ングによる分配消去法ー項書換え系の停止性証明法
コンピュータソフトウェア 13(2):58--73.

 

Nakahara, K, Middeldrop, A, and Ida, T (1995).
A Complete Narrowing Calculus for Higher-order Functional Logic Programming
In: Proceedings of the 7th International Conference on Programming Languages: Implementations, Logics and Programs 95 (PLILP'95). Springer, Lecture Notes in Computer Science 982, pages 97--114.

 

Okui, S, Middeldrop, A, and Ida, T (1995).
Lazy narrowing: strong completeness and eager variable elimination
In: Proceeding of the 20th Colloquium on trees in algebra and Programming (CAAP). Springer-Verlag, Lecture Notes in Computer Science 915, pages 394--409.

 

Suzuki, T, Middeldrop, A, and Ida, T (1995).
Level-confluence of conditional rewrite systems with extra variables in right-hand sides
In: Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA). Springer, Lecture Notes in Computer Science 914, pages 179--193.

 

中川, �, 鈴木, �, 中原, �, and 井田, � (1995).
遅延ナーローイ ング抽象機械
電子情報通信学会論文誌 J78-D-1(5):467ー477.

 

佐々木, � and 井田, � (1995).
制約解 消系を備えた関数・論理型言語の処理系とその実装
情報処理学会論文誌 36(9):2152 - 2160.

 

山田, �, Middeldorp, A, and 井田, � (1995).
項書換え系における階層合流性のモジュラー性
コンピュータソフトウェア 12(5):72-84.

 

浜名, �, 西岡, �, 中原, �, Middeldorp, A, and 井田, � (1995).
作用型項書換え系に基づく関数論理型言語の設計と実装
情報処理学会論文誌 36(8):1897-1905.

 

Amamiya, M, Satoh, M, Makinouchi, A, Hagiwara, K, Yuasa, T, Aida, H, Ueda, K, Araki, K, Ida, T, and Baba, T (1994).
Research on Programming Languages for Massively Parallel Processing
In: Proceeding of International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN). IEEE, pages 443--451.

 

Ida, T and Okui, S (1994).
Outside-in conditional narrowing
IEICE TRANSACTIONS on Information and Systems E77-D(6):631--641.

 

Minamide, Y (1994).
Sharing analysis based on type inference
Formal aspects of computing:659-675.

 

Ida, T, Kim, M, and Jhon, C (1992).
G-system: A functionality-based communication system model for parallel processing
Journal of Information Processing 92, Elsevier Science Publishers B.V 1:179--178.

 

Marin, M (1992).
Pyramidal Structures and Text Recognition
Masters thesis, University of Timisoara, Timisoara.

 

Nakamura, A, Suzuki, T, and Ida, T (1992).
Abstract Machine Approach to Operational Semantics of Prolog
Journal of Information Processing 15(4):545--553.

 

井田, � (1991).
計算モデルの基礎理論
岩波書店, 東京(ISBN: ISBN4-00-010352-0 C3355 P3700E).

 

松野, � and 井田, � (1991).
MC/LISP 処理系の翻訳系の構成
コンピュータソフトウエア 8(2):53-67.

 

Ida, T and Matsuno, T (1990).
Overview of MC/LISP
Journal of Information Processing 13(3):304--317.

 

Ida, T and Matsuno, T (1990).
Implementing Lisp and Prolog on a Common Abstract Machine: A Practical Approach to Combining Functional and Logic Programming
In: Declarative Systems: Proceeding of the IFIP TC 10/WG 10.1 Workshop on Concepts and Characteristics of Declarative Systems. Elsevier Science Publishers B.V, North Holland, pages 227--252.

 

Ida, T, Aiba, A, and Toyama, Y (1988).
T: A simple reduction language based on combinatory term rewriting
In: Programming of Future Generation Computers, edited by K.Fuchi and M.Nivat. Elsevier Science Publishers B.V, pages 261--275.

 

井田, � (1988).
プログラミング言語の新潮流
共立出版.

 

Ida, T and Tanaka, J (1984).
Functional Programming with Streams-part II
Journal of New Generation Computing 2(3):261--275.

 

Ida, T and Tanaka, J (1983).
Functional programming with streams
Information Processing 83:265--270.

 

Goto, E, Soma, T, Inada, N, Ida, T, Idesawa, M, Hiraki, K, Suzuki, M, Shimizu, K, and Philipov, B (1982).
Design of a Lisp machine - FLATS
In: Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming. ACM Press, pages 208--215.

 

Goto, E, Ida, T, Hiraki, K, Suzuki, M, and Inada, N (1979).
FLATS, a machine for numerical, symbolic and associative computing
In: Proceedings of the 6th Annual Symposium on Computer Architecture. ACM Press, pages 102--110.

 

Ida, T and Goto, E (1978).
Analysis of parallel hashing algorithms with key deletion
Journal of Information Processing 1:25--32.

 

Ida, T and Goto, E (1977).
Performance of a parallel hash hardware with key deletion
Information Processing 77:643--647.

« November 2017 »
November
SuMoTuWeThFrSa
1234
567891011
12131415161718
19202122232425
2627282930