Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
113 | Manuel Rubio-Sánchez, Jaime Urquiza-Fuentes, Cristóbal Pareja-Flores |
A gentle introduction to mutual recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008, Madrid, Spain, June 30 - July 2, 2008, pp. 235-239, 2008, ACM, 978-1-60558-078-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
recursion problems, combinatorics, counting problems, fibonacci numbers, mutual recursion |
100 | Naoki Kobayashi 0001 |
Types and Recursion Schemes for Higher-Order Program Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 7th Asian Symposium, APLAS 2009, Seoul, Korea, December 14-16, 2009. Proceedings, pp. 2-3, 2009, Springer, 978-3-642-10671-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
98 | Tamarisk Lurlyn Scholtz, Ian D. Sanders |
Mental models of recursion: investigating students' understanding of recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2010, Bilkent, Ankara, Turkey, June 26-30, 2010, pp. 103-107, 2010, ACM, 978-1-60558-729-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
recursion, mental models |
92 | Ian Douglas Sanders, Vashti C. Galpin |
Students' mental models of recursion at wits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007, pp. 317, 2007, ACM, 978-1-59593-610-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
recursion, mental models |
91 | J. Ángel Velázquez-Iturbide |
Recursion in gradual steps (is recursion really that difficult?). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2000, Austin, Texas, USA, March 7-12, 2000, pp. 310-314, 2000, ACM, 1-58113-213-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
85 | Greg Stitt, Jason R. Villarreal |
Recursion flattening. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 18th ACM Great Lakes Symposium on VLSI 2008, Orlando, Florida, USA, May 4-6, 2008, pp. 131-134, 2008, ACM, 978-1-59593-999-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
optimization, fpga, compilers, synthesis, recursion |
78 | David Ginat, Eyal Shifroni |
Teaching recursion in a procedural environment -- how much should we emphasize the computing model? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1999, New Orleans, Louisiana, USA, March 14-28, 1999, pp. 127-131, 1999, ACM, 1-58113-085-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
recursive formulation, problem decomposition |
78 | Yannis E. Ioannidis, Eugene Wong 0001 |
Towards an Algebraic Theory of Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(2), pp. 329-381, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
78 | Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre |
Collapsible Pushdown Automata and Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 452-461, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Higher-order pushdown automata, game semantics, higher-order recursion schemes |
78 | Tina Götschi, Ian D. Sanders, Vashti Galpin |
Mental models of recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2003, Reno, Nevada, USA, February 19-23, 2003, pp. 346-350, 2003, ACM, 1-58113-648-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
learning, programming, pedagogy, recursion, mental models, constructivism |
78 | Peter Buneman, Mary F. Fernandez, Dan Suciu |
UnQL: A Query Language and Algebra for Semistructured Data Based on Structural Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 9(1), pp. 76-110, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Structural recursion, Optimization, XML, Query language, Semistructured data, XSL |
76 | Yongping Gao, Fenfen Guan |
Explore a New Way to Convert a Recursion Algorithm into a Non-recursion Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCTA ![In: Computer And Computing Technologies In Agriculture, Volume I, First IFIP TC 12 International Conference on Computer and Computing Technologies in Agriculture (CCTA 2007), Wuyishan, China, August 18-20, 2007, pp. 187-193, 2007, Springer, 978-0-387-77250-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
sequence storage, bit link tree, non-recursion, recursion, queue |
71 | Michael H. Goldwasser, David Letscher |
Teaching strategies for reinforcing structural recursion with lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA Companion ![In: Companion to the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2007, October 21-25, 2007, Montreal, Quebec, Canada, pp. 889-896, 2007, ACM, 978-1-59593-865-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
active learning, recursion, role-playing, lists |
71 | Owen Kaser, C. R. Ramakrishnan 0001, Shaunak Pawagi |
On the Conversion of Indirect to Direct Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPLAS ![In: LOPLAS 2(1-4), pp. 151-164, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
inline substitution, procedure inlining, theory, call graphs, mutual recursion |
70 | Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht, Stijn Vansummeren |
Structural Recursion as a Query Language on Lists and Ordered Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 44(4), pp. 590-619, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Structural recursion, XML, Database, Complex objects, Primitive recursion |
64 | E. A. Cichon, Hélène Touzet |
An Ordinal Calculus for Proving Termination in Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, Linköping, Sweden, April, 22-24, 1996, Proceedings, pp. 226-240, 1996, Springer, 3-540-61064-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
ordinal recursion, termination, rewrite systems, primitive recursion |
64 | Manuel Rubio-Sánchez |
Tail recursive programming by applying generalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2010, Bilkent, Ankara, Turkey, June 26-30, 2010, pp. 98-102, 2010, ACM, 978-1-60558-729-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
nested recursion, formal methods, generalization, recursion, design of algorithms, tail recursion |
64 | John Case, Samuel E. Moelius |
Independence Results for n-Ary Recursion Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings, pp. 38-49, 2009, Springer, 978-3-642-03408-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
63 | Stephen A. Edwards, Jia Zeng |
Static elaboration of recursion for concurrent software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, San Francisco, California, USA, January 7-8, 2008, pp. 71-80, 2008, ACM, 978-1-59593-977-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
SHIM, static elaboration, concurrency, recursion, partial evaluation |
63 | David Ginat |
Do senior CS students capitalize on recursion? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2004, Leeds, UK, June 28-30, 2004, pp. 82-86, 2004, ACM, 1-58113-836-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
student errors, ways of reasoning, pedagogy, recursion |
63 | Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn |
Linear Ramified Higher Type Recursion and Parallel Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Theory in Computer Science ![In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, pp. 1-21, 2001, Springer, 3-540-42752-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
higher types, parallel computation, recursion, linear logic, lambda calculus, implicit computational complexity, NC |
63 | Manuel Rubio-Sánchez, Isidoro Hernán-Losada |
Exploring recursion with fibonacci numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007, pp. 359, 2007, ACM, 978-1-59593-610-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
recursion problems, combinatorics, fibonacci numbers, mutual recursion |
63 | Bruria Haberman, Haim Averbuch |
The case of base cases: why are they so difficult to recognize? student difficulties with recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 7th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2002, Aarhus, Denmark, June 24-28, 2002, pp. 84-88, 2002, ACM, 1-58113-499-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
base case, recursion evaluation, recursion formulation |
63 | Manuel Rubio-Sánchez, J. Ángel Velázquez-Iturbide |
Tail recursion by using function generalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 14th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2009, Paris, France, July 6-9, 2009, pp. 394, 2009, ACM, 978-1-60558-381-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
nested recursion, generalization, recursion, design of algorithms, tail recursion |
57 | Philippe Beaucamps |
Extended recursion-based formalization of virus mutation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Virol. ![In: J. Comput. Virol. 5(3), pp. 209-219, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
57 | Stefaan Himpe, Francky Catthoor, Geert Deconinck |
Control Flow Analysis for Recursion Removal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCOPES ![In: Software and Compilers for Embedded Systems, 7th International Workshop, SCOPES 2003, Vienna, Austria, September 24-26, 2003, Proceedings, pp. 101-116, 2003, Springer, 3-540-20145-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
56 | Meisam Fathi Salmi, Saeed Parsa |
Automatic Detection of Infinite Recursion in AspectJ Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FGIT ![In: Future Generation Information Technology, First International Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Proceedings, pp. 190-197, 2009, Springer, 978-3-642-10508-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Infinite Recursion, Interprocedural Anlysis, Debugging Aspect-Oriented Programs, Aspect-Oriented Programming |
56 | Derek Dreyer |
A type system for well-founded recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004, pp. 293-305, 2004, ACM, 1-58113-729-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
yype systems, recursion, effect systems, recursive modules |
55 | Neil W. Rickert |
Recursion vs. non-Recursion in Pascal; a rejoinder. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 22(9), pp. 12-13, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
Pascal |
50 | Manuel Lameiras Campagnolo |
The Complexity of Real Recursive Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UMC ![In: Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings, pp. 1-14, 2002, Springer, 3-540-44311-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Continuous-time computation, computational complexity, differential equations, recursion theory |
49 | Naoki Kobayashi 0001, C.-H. Luke Ong |
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 179-188, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
49 | Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem |
Recursion Schemata for NCk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 49-63, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Raja Sooriamurthi |
Problems in comprehending recursion and suggested solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 6th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2001, Canterbury, UK, June 25-27, 2001, pp. 25-28, 2001, ACM, 1-58113-330-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
49 | Radu Rugina, Martin C. Rinard |
Recursion Unrolling for Divide and Conquer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCPC ![In: Languages and Compilers for Parallel Computing, 13th International Workshop, LCPC 2000, Yorktown Heights, NY, USA, August 10-12, 2000, Revised Papers, pp. 34-48, 2000, Springer, 3-540-42862-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
49 | William D. Clinger |
Proper Tail Recursion and Space Efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, June 17-19, 1998, pp. 174-185, 1998, ACM, 0-89791-987-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
SCHEME |
49 | Sowmitri Swamy, John E. Savage |
Space-Time Tradeoffs for Linear Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, San Antonio, Texas, USA, January 1979, pp. 135-142, 1979, ACM Press. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
49 | Marian Boykan Pour-El |
Computer Science And Recursion Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Annual Conference (1) ![In: Proceedings 1978 ACM Annual Conference, Washington, DC, USA, December 4-6, 1978, Volume I, pp. 15-20, 1978, ACM, 978-0-89791-000-2. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
49 | Naoki Kobayashi 0001, Naoshi Tabuchi, Hiroshi Unno 0001 |
Higher-order multi-parameter tree transducers and recursion schemes for program verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010, pp. 495-508, 2010, ACM, 978-1-60558-479-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
higher-order tree transducers, tree-processing programs, program verification, higher-order recursion scheme |
49 | Christopher H. Broadbent, C.-H. Luke Ong |
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 107-121, 2009, Springer, 978-3-642-00595-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Collapsible Pushdown Automaton, Parity Game, Model Checking, Game Semantics, Recursion Scheme |
49 | Ben Stephenson |
Visual examples of recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 14th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2009, Paris, France, July 6-9, 2009, pp. 400, 2009, ACM, 978-1-60558-381-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
graphical projects, computer science education, pedagogy, recursion, recursive algorithms, student engagement |
49 | Jirí Adámek, Stefan Milius, Jirí Velebil |
Semantics of Higher-Order Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALCO ![In: Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings, pp. 49-63, 2009, Springer, 978-3-642-03740-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
infinite ?-terms, sets in context, rational tree, Higher-order recursion schemes |
49 | Ian D. Sanders, Vashti Galpin, Tina Götschi |
Mental models of recursion revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2006, Bologna, Italy, June 26-28, 2006, pp. 138-142, 2006, ACM, 1-59593-055-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
recursion, mental models |
49 | Christian Urban, Stefan Berghofer |
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 498-512, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Lambda-calculus, proof assistants, nominal logic, primitive recursion |
49 | Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh |
Why structural recursion should be taught before arrays in CS 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2005, St. Louis, Missouri, USA, February 23-27, 2005, pp. 246-250, 2005, ACM, 1-58113-997-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
CS1, recursion |
49 | S. J. Ambler, Roy L. Crole, Alberto Momigliano |
A definitional approach to primitivexs recursion over higher order abstract syntax. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MERLIN ![In: Eighth ACM SIGPLAN International Conference on Functional Programming, Workshop on Mechanized reasoning about languages with variable binding, MERLIN 2003, Uppsala, Sweden, August 2003, 2003, ACM, 978-1-58113-800-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Isabelle HOL, topos theory, ?-calculus, higher order abstract syntax, primitive recursion, initial algebras |
47 | Howard A. Blair, V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel (eds.) |
Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![Mathematical Sciences Institute, Cornell University The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | Andrei Voronkov |
On Computability by Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 165-, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | Audrey Ferry |
A Topological Characterization of the Stable and Minimal Model Classes of Propositional Logical Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 45-68, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | Thomas Eiter, Georg Gottlob |
Complexity Results for Logic-Based Abduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 29-44, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | Yael Moscowitz, Ehud Shapiro |
On the Structural Simplicity of Machines and Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 103-120, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | Jürgen Dix, Martin Müller 0001 |
Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 15-28, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier |
Halting Problem of One Binary Horn Clause id Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 5-14, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
Rule Systems and Well-Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 69-92, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | Inderpal Singh Mumick, Oded Shmueli |
Aggregation, Computability, and Complete Query Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 121-142, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski |
Complexity of Computing with Extended Propositional Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 93-102, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
47 | John S. Schlipf |
A Survey of Complexity and Undecidability Results in Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Complexity and Recursion-theoretic methods in Logic-Programming ![In: Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992, pp. 143-164, 1992, Mathematical Sciences Institute, Cornell University. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
43 | Robert Law |
Using student blogs for documentation in software development projects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 16th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2011, Darmstadt, Germany, June 27-29, 2011, pp. 366, 2011, ACM, 978-1-4503-0697-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
43 | Ba-Tuong Vo, Ba-Ngu Vo, Antonio Cantoni |
Bayesian Filtering With Random Finite Set Observations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(4), pp. 1313-1326, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Ba-Tuong Vo, Ba-Ngu Vo, Antonio Cantoni |
Analytic Implementations of the Cardinalized Probability Hypothesis Density Filter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(7-2), pp. 3553-3567, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Adrian Johnstone, Elizabeth Scott |
Generalised Regular Parsers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 12th International Conference, CC 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings, pp. 232-246, 2003, Springer, 3-540-00904-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Bjarne Stig Andersen, Fred G. Gustavson, Alexander Karaivanov, Minka Marinova, Jerzy Wasniewski, Plamen Y. Yalamov |
LAWRA: Linear Algebra with Recursive Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing, New Paradigms for HPC in Industry and Academia, 5th International Workshop, PARA 2000 Bergen, Norway, June 18-20, 2000 Proceedings, pp. 38-51, 2000, Springer, 3-540-41729-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
43 | Marta Franová |
Automated Inductive Reasoning as a Support of Deductive Reasoning in a User-Independent Automation of Inductive Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, pp. 551-560, 1996, Springer, 3-540-61286-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
43 | Edward H. Bensley, Thomas J. Brando, J. C. Fohlin, Myra Jean Prelle, Ann Wollrath |
MITRE's future generation computer architectures program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA/ECOOP Workshop on Object-based Concurrent Programming ![In: Proceedings of the 1988 ACM SIGPLAN Workshop on Object-based Concurrent Programming, OOPSLA/ECOOP Workshop on Object-based Concurrent Programming 1988, San Diego, CA, USA, September 26-27, 1988, pp. 99-101, 1988, ACM, 978-0-89791-304-1. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
43 | Andrew M. Pitts |
Nominal system T. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010, pp. 159-170, 2010, ACM, 978-1-60558-479-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
alpha-equivalence, types, recursion, binders |
43 | Naoki Kobayashi 0001 |
Model-checking higher-order functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, September 7-9, 2009, Coimbra, Portugal, pp. 25-36, 2009, ACM, 978-1-60558-568-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
model checking, program verification, higher-order functions, recursion schemes |
43 | John Case, Samuel E. Moelius |
Program Self-reference in Constructive Scott Subdomains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 89-98, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scott domains, self-reproducing programs, self-reference, recursion theorems, numberings |
43 | Anton Setzer |
Partial Recursive Functions in Martin-Löf Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 505-515, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Martin-Löf type theory, Kleene index, Kleene brackets, partial recursive functions, inductive-recursive definitions, indexed induction-recursion, computability theory, recursion theory |
42 | Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht, Stijn Vansummeren |
Structural Recursion on Ordered Trees and List-Based Complex Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings, pp. 344-358, 2007, Springer, 3-540-69269-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Jevgeni Kabanov, Varmo Vene |
Recursion Schemes for Dynamic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MPC ![In: Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings, pp. 235-252, 2006, Springer, 3-540-35631-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Martin J. Fischer, Denise M. Bevilacqua Masi |
Analyzing internet packet traces using Lindley's Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the Winter Simulation Conference WSC 2006, Monterey, California, USA, December 3-6, 2006, pp. 2195-2201, 2006, IEEE Computer Society, 1-4244-0501-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Wolfram T. Arnold, Roger Haydock |
A Parallel, Object-Oriented Implementation of the Dynamic Recursion Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCOPE ![In: Computing in Object-Oriented Parallel Environments, Second International Symposium, ISCOPE 98, Santa Fe, NM, USA, December 8-11, 1998, Proceedings, pp. 199-206, 1998, Springer, 3-540-65387-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
42 | Bruce S. Elenbogen, Martha R. O'Kennon |
Teaching recursion using fractals in Prolog. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 19th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1988, Atlanta, Georgia, USA, February 25-26, 1988, pp. 263-266, 1988, ACM, 978-0-89791-256-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Prolog |
42 | Jean H. Gallier |
Recursion Schemes and Generalized Interpretations (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 256-270, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
42 | Claudio Mirolo |
Learning (through) recursion: a multidimensional analysis of the competences achieved by CS1 students. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2010, Bilkent, Ankara, Turkey, June 26-30, 2010, pp. 160-164, 2010, ACM, 978-1-60558-729-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
recursion, mental models, programming learning |
42 | Ugo Dal Lago |
The geometry of linear higher-order recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(2), pp. 8:1-8:38, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
higher-order recursion, type systems, lambda calculus, implicit computational complexity, Geometry of interaction |
42 | J. Ángel Velázquez-Iturbide, Antonio Pérez-Carrasco, Jaime Urquiza-Fuentes |
Interactive visualization of recursion with SRec. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 14th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2009, Paris, France, July 6-9, 2009, pp. 339, 2009, ACM, 978-1-60558-381-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
human-computer interaction, recursion, program visualization, algorithm animation |
42 | Alessandro Warth, James R. Douglass, Todd D. Millstein |
Packrat parsers can support left recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, San Francisco, California, USA, January 7-8, 2008, pp. 103-110, 2008, ACM, 978-1-59593-977-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
left recursion, packrat parsing |
42 | J. Ángel Velázquez-Iturbide, Antonio Pérez-Carrasco, Jaime Urquiza-Fuentes |
SRec: an animation system of recursion for algorithm courses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2008, Madrid, Spain, June 30 - July 2, 2008, pp. 225-229, 2008, ACM, 978-1-60558-078-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
activation trees, usability, recursion, program animation |
42 | Johan Nordlander, Magnus Carlsson, Andy Gill |
Unrestricted pure call-by-value recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ML ![In: Proceedings of the ACM Workshop on ML, 2008, Victoria, BC, Canada, September 21, 2008, pp. 23-34, 2008, ACM, 978-1-60558-062-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
value recursion, semantics, implementation, combinator libraries, call-by-value |
42 | Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion |
A Classification of Viruses Through Recursion Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 73-82, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
iteration theorem, polymorphism, propagation, Computer viruses, recursion theorem |
42 | Andrew M. Pitts |
Alpha-structural recursion and induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(3), pp. 459-506, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
recursion, induction, names, Abstract syntax, binders |
42 | Jordan Zashev |
Diagonal fixed points in algebraic recursion theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(8), pp. 973-994, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Algebraic recursion theory-Combinatory logic |
42 | David von Oheimb |
Hoare Logic for Mutual Recursion and Local Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings, pp. 168-180, 1999, Springer, 3-540-66836-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
axiomaticsemantics, relative completeness, local variables, call-by-value parameters, soundness, Hoare logic, Isabelle/HOL, mutual recursion |
42 | Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer Høgsbro Rose |
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, September 24-27, 1996, Proceedings, pp. 393-407, 1996, Springer, 3-540-61756-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Implementation of functional programming, weak reduction, space leaks, recursion, sharing, lambda calculus, explicit substitution |
42 | Marcello M. Bonsangue, Joost N. Kok |
Semantics, Orderings and Recursion in the Weakest Precondition Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Sematics: Foundations and Applications, REX Workshop, Beekbergen, The Netherlands, June 1-4, 1992, Proceedings, pp. 91-109, 1992, Springer, 3-540-56596-5. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
fixed point transformations, Smyth powerdomain, Egli-Milner powerdomain, refinement, deadlock, recursion, fixed points, backtracking, weakest preconditions, predicate transformers |
40 | Jishnu Ray Chowdhury, Cornelia Caragea |
Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.04449, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
40 | Jishnu Ray Chowdhury, Cornelia Caragea |
Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
40 | Kenneth C. Louden |
Recursion versus non-recursion in Pascal: recursion can be faster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 22(2), pp. 62-67, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
36 | Alberto Pardo |
Combining Datatypes and Effects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advanced Functional Programming ![In: Advanced Functional Programming, 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures, pp. 171-209, 2004, Springer, 3-540-28540-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | James L. Caldwell |
Extracting General Recursive Program Schemes in Nuprl's Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected Papers, pp. 233-244, 2001, Springer, 3-540-43915-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Isak Jonsson, Bo Kågström |
RECSY - A High Performance Library for Sylvester-Type Matrix Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings, pp. 810-819, 2003, Springer, 3-540-40788-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Sylvester-type matrix equations, RECSY, recursion, superscalar, LAPACK, level 3 BLAS, GEMM-based, SLICOT, automatic blocking |
36 | Ching-Long Su, Yin-Tsung Hwang |
Distributed arithmetic-based architectures for high speed IIR filter design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), June 3-6, 1996, Tokyo, Japan, Proceedings, pp. 156-161, 1996, IEEE Computer Society, 0-8186-7267-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
high speed IIR filter, pipelining techniques, SPDM technology, parallel processing, parallel architectures, digital arithmetic, recursion, recursive filters, Distributed Arithmetic, IIR filters, DSP applications |
35 | Toshiyasu Arai, Naohi Eguchi |
A new function algebra of EXPTIME functions by safe nested recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(4), pp. 24:1-24:19, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
EXPTIME, Implicit computational complexity |
35 | Horacio A. B. F. de Oliveira, Azzedine Boukerche, Eduardo Freire Nakamura, Antonio Alfredo Ferreira Loureiro |
An Efficient Directed Localization Recursion Protocol for Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 58(5), pp. 677-691, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Spyridon Ninos, Apostolos Dollas |
Modeling recursion data structures for FPGA-based implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: FPL 2008, International Conference on Field Programmable Logic and Applications, Heidelberg, Germany, 8-10 September 2008, pp. 11-16, 2008, IEEE, 978-1-4244-1961-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Zhongfeng Wang 0001 |
High-Speed Recursion Architectures for MAP-Based Turbo Decoders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 15(4), pp. 470-474, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | William L. Harrison |
A Simple Semantics for Polymorphic Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, Third Asian Symposium, APLAS 2005, Tsukuba, Japan, November 2-5, 2005, Proceedings, pp. 37-51, 2005, Springer, 3-540-29735-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro |
Comparing Recursion, Replication, and Iteration in Process Calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 307-319, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Mike Reed |
Order, Topology, and Recursion Induction in CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
25 Years Communicating Sequential Processes ![In: Communicating Sequential Processes: The First 25 Years, Symposium on the Occasion of 25 Years of CSP, London, UK, July 7-8, 2004, Revised Invited Papers, pp. 242-242, 2004, Springer, 3-540-25813-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Jan-Georg Smaus |
The Head Condition and Polymorphic Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLOPS ![In: Functional and Logic Programming, 6th International Symposium, FLOPS 2002, Aizu, Japan, September 15-17, 2002, Proceedings, pp. 259-274, 2002, Springer, 3-540-44233-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|