| Sample search results for: abbott thorsten altenkirch |
| 1 | Fundamenta Informaticae XX (2005) 129 1 for Data: Differentiating Data Structures | ||
|
Summary: Thorsten Altenkirch C School of Computer Science & IT, The University of Nottingham 1%2 §#¨£34$)¨& 1!1 $5... §£'$)(0 Abstract. This paper and our conference paper (Abbott, Altenkirch, Ghani, and McBride, 2003b) explain... type, which leads to the notion of a container, introduced in ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 2 | The Midlands Graduate School (MGS) in the Foundations of Computing Science was established in 1999, and organises an annual Spring School on | ||
|
Summary: Levy Typed Lambda Calculus Thorsten Altenkirch Dependently Typed Programming Roland Backhouse |
|||
|
Source: Priestley, Hilary - Mathematical Institute, University of Oxford |
|||
|
Collection: Mathematics |
|||
| 3 | Set-based Operators and Fixed-Points by Support Andreas Abel | ||
|
Summary: and Thorsten Altenkirch. A predicative analysis of struc- tural recursion. Journal of Functional... April 22, 2004 In Abel and Altenkirch's article A Predicative Analysis of Structural Recur- sion... , otherwise undefined. Consid* *er the following correspondences: ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 4 | Set-based Operators and Fixed-Points by Support Andreas Abel | ||
|
Summary: . References [AA02] Andreas Abel and Thorsten Altenkirch. A predicative analysis of struc- tural recursion... Set-based Operators and Fixed-Points by Support Andreas Abel April 22, 2004 In Abel and Altenkirch... . Consider the following correspondences: Abel, Altenkirch Pierce Val U [[]] F U supportF 1 #12;Then ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 5 | Higher-Order Containers Thorsten Altenkirch1 | ||
|
Summary: Higher-Order Containers Thorsten Altenkirch1 , Paul Levy2 , and Sam Staton3 1 University... . 2. M. Abbott, T. Altenkirch, and N. Ghani. Containers - constructing strictly pos- itive types... for future work. References 1. M. Abbott. Categories of Containers. PhD thesis, University of ... |
|||
|
Source: Cheng, Eugenia - Department of Pure Mathematics, University of Sheffield |
|||
|
Collection: Mathematics |
|||
| 6 | Higher Order Containers Thorsten Altenkirch1 | ||
|
Summary: Higher Order Containers Thorsten Altenkirch1 , Paul Levy2 , and Sam Staton3 1 University... . 8 #12;References [AAG05] M. Abbott, T. Altenkirch, and N. Ghani. Containers - constructing strictly... . [AAGM04] M. Abbott, T. Altenkirch, N. Ghani, and C. McBride. ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham; Levy, Paul Blain - School of Computer Science, University of Birmingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 7 | Representing Nested Inductive Types using W-types | ||
|
Summary: Representing Nested Inductive Types using W-types Michael Abbott1, Thorsten Altenkirch2, and Neil... . Abbott, T. Altenkirch, and N. Ghani. Categories of containers. In Proceedings of Foundations of Software... is the insight that SPITs give rise to containers, which we have investigated ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 8 | Constructing Strictly Positive Types Michael Abbott a, Thorsten Altenkirch b, Neil Ghani c | ||
|
Summary: Containers Constructing Strictly Positive Types Michael Abbott a, Thorsten Altenkirch b, Neil Ghani... @araneidae.co.uk (Michael Abbott), txa@cs.nott.ac.uk (Thorsten Altenkirch), ng13@mcs.le.ac.uk (Neil Ghani). Preprint... and container functors, introduced in ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 9 | A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch | ||
|
Summary: A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch February 1st, 1999... necessary. References [Alf94] Thorsten Altenkirch, Veronica Gaspes, Bengt Nordstr¨om, and Bj¨orn von Sydow |
|||
|
Source: Giesl, Juergen - Fachgruppe Informatik, Rheinisch-Westfälische Technische Hochschule Aachen (RWTH |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 10 | A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch | ||
|
Summary: A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch February 1st, 1999... is actually necessary. References [Alf94] Thorsten Altenkirch, Veronica Gaspes, Bengt Nordstrom, and Bj |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 11 | A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch | ||
|
Summary: A semantical analysis of structural recursion Andreas Abel, Thorsten Altenkirch February 1st, 1999... ] Thorsten Altenkirch, Veronica Gaspes, Bengt Nordstr¨om, and Bj¨orn von Sydow. A user's guide to ALF |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 12 | Monads Need Not Be Endofunctors Thorsten Altenkirch1 | ||
|
Summary: Monads Need Not Be Endofunctors Thorsten Altenkirch1 , James Chapman2 , and Tarmo Uustalu2 1 School... Foundation grant no. 6940. #12;Monads Need Not Be Endofunctors 311 References 1. Abbott, M., Altenkirch, T... #12;298 T. Altenkirch, J. Chapman, and T. Uustalu Here Fin is the category ... |
|||
|
Source: Uustalu, Tarmo - Institute of Cybernetics, Tallinn Technical University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 13 | Set-based Operators and Fixed-Points by Support Andreas Abel | ||
|
Summary: 's algo- rithm. References [AA02] Andreas Abel and Thorsten Altenkirch. A predicative analysis of struc... Set-based Operators and Fixed-Points by Support Andreas Abel April 22, 2004 In Abel and Altenkirch... , Altenkirch Pierce Val U [[#27;]] F U #27; support F 1 #12; Then (sb2) expresses that U #27; (v |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 14 | Participants MGS 2007 Henrik Addico University of Sheffield | ||
|
Summary: Participants MGS 2007 Henrik Addico University of Sheffield Thorsten Altenkirch University |
|||
|
Source: Priestley, Hilary - Mathematical Institute, University of Oxford |
|||
|
Collection: Mathematics |
|||
| 15 | Termination Checking Nested Inductive and Coinductive Types Thorsten Altenkirch and Nils Anders Danielsson | ||
|
Summary: Termination Checking Nested Inductive and Coinductive Types Thorsten Altenkirch and Nils Anders... fixpoints in a nice way? References Andreas Abel and Thorsten Altenkirch. A predicative analysis... . Available at http://wiki.portal.chalmers.se/agda/, 2010. Nils Anders Danielsson and ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 16 | Representing Nested Inductive Types using Wtypes | ||
|
Summary: Representing Nested Inductive Types using Wtypes Michael Abbott 1 , Thorsten Altenkirch 2... , 2003. M. Abbott, T. Altenkirch, and N. Ghani. Categories of containers. In Proceedings of Foundations... . Abbott, T. Altenkirch, and N. Ghani. ... |
|||
|
Source: Ghani, Neil - Department of Computer and Information Sciences, University of Strathclyde |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 17 | Representing Nested Inductive Types using Wtypes | ||
|
Summary: Representing Nested Inductive Types using Wtypes Michael Abbott 1 , Thorsten Altenkirch 2... and Computation Structures, volume 2620 of Lecture Notes in Computer Science, 2003. M. Abbott, T. Altenkirch... in Abbott et al. (2003) and which are the topic of ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 18 | Acta Informatica manuscript No. (will be inserted by the editor) | ||
|
Summary: Structures Michael Abbott 1 , Thorsten Altenkirch 2 , Neil Ghani 1 , Conor McBride 3 1 Department... (Abbott, Altenkirch, Ghani, and McBride, 2003b) explain and analyse the notion of the derivative of a data... , introduced in Abbott, Altenkirch, ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester; Ghani, Neil - Department of Computer and Information Sciences, University of Strathclyde |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 19 | International Journal of Foundations of Computer Science c World Scientific Publishing Company | ||
|
Summary: collection of generic functions. References 1. Michael Abbott, Thorsten Altenkirch, and Neil Ghani... . Applied Semantics: Selected Topics. 2. Michael Abbott, Thorsten Altenkirch, Neil Ghani, and Conor Mc... A Universe of Strictly Positive Families PETER MORRIS and ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham; Ghani, Neil - Department of Computer and Information Sciences, University of Strathclyde |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 20 | Exploring the Regular Tree Types Peter Morris, Thorsten Altenkirch and Conor McBride | ||
|
Summary: . Categories of Containers. PhD thesis, University of Leicester, 2003. 2. Michael Abbott, Thorsten Altenkirch... Structures, 2003. 3. Michael Abbott, Thorsten Altenkirch, Neil Ghani, and Conor McBride. for data... Exploring the Regular Tree Types Peter Morris, ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 21 | Constructing Polymorphic Programs with Quotient Michael Abbott 1 , Thorsten Altenkirch 2 , Neil Ghani 1 , and Conor McBride 3 | ||
|
Summary: Constructing Polymorphic Programs with Quotient Types Michael Abbott 1 , Thorsten Altenkirch 2... , generic programming, dependent types (Altenkirch and McBride, 2003), higher order types (Fiore et al... . To execute this program of research we extend our work on container datatypes ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 22 | Constructing Polymorphic Programs with Quotient Michael Abbott 1 , Thorsten Altenkirch 2 , Neil Ghani 1 , and Conor McBride 3 | ||
|
Summary: Constructing Polymorphic Programs with Quotient Types Michael Abbott 1 , Thorsten Altenkirch 2... of Containers. PhD thesis, University of Leicester, 2003. M. Abbott, T. Altenkirch, and N. Ghani. Categories... Science, pages 23--38. SpringerVerlag, 2003a. M. Abbott, ... |
|||
|
Source: Ghani, Neil - Department of Computer and Information Sciences, University of Strathclyde |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 23 | Constructing Strictly Positive Families Peter Morris Thorsten Altenkirch Neil Ghani | ||
|
Summary: Constructing Strictly Positive Families Peter Morris Thorsten Altenkirch Neil Ghani School... including a generic program to decide equality. · Containers (Abbott, Altenkirch & Ghani 2005... - tives of data types (Abbott, Altenkirch, Ghani & McBride 2005). In ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 24 | Proof Theory meets Type Theory Swansea, UK, 15 -16 March 2008 | ||
|
Summary: Name First Name Email Location Country Aczel Peter petera@cs.man.ac.uk Manchester UK Altenkirch... Thorsten txa@Cs.Nott.AC.UK Nottingham UK Berry Peter pwb@sucs.org Swansea UK Beckmann Arnold A |
|||
|
Source: Setzer, Anton - Department of Computer Science, University of Wales Swansea |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 25 | Generic Programming with Dependent Types Thorsten Altenkirch, Conor McBride and Peter Morris | ||
|
Summary: Generic Programming with Dependent Types Thorsten Altenkirch, Conor McBride and Peter Morris School |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 26 | Continuous Functions on Final Coalgebras Neil Ghani1 | ||
|
Summary: at higher types. References [1] Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Categories... Abbott, Thorsten Altenkirch, and Neil Ghani. Representing nested inductive types using W- types... Abbott, Thorsten ... |
|||
|
Source: Ghani, Neil - Department of Computer and Information Sciences, University of Strathclyde |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 27 | Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be | ||
|
Summary: and Computation Structures, 2003. [2] Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Representing nested... ), pages 59 71, 2004. [3] Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Containers - constructing... : Selected Topics. [4] Michael ... |
|||
|
Source: Pattinson, Dirk - Department of Computing, Imperial College, London |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 28 | Constructing Polymorphic Programs with Quotient Michael Abbott1, Thorsten Altenkirch2, Neil Ghani1, and Conor McBride3 | ||
|
Summary: Constructing Polymorphic Programs with Quotient Types Michael Abbott1, Thorsten Altenkirch2, Neil... , 2003. [2] Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Categories of containers. In Andrew... 38. Springer-Verlag, 2003. [3] Michael ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 29 | Constructing Strictly Positive Types Michael Abbott a, Thorsten Altenkirch b, Neil Ghani a | ||
|
Summary: Containers Constructing Strictly Positive Types Michael Abbott a, Thorsten Altenkirch b, Neil Ghani... , 2003. M. Abbott, T. Altenkirch, and N. Ghani. Categories of containers. In Proceedings of Foundations... . Abbott, T. Altenkirch, and N. Ghani. ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 30 | Indexed Containers Thorsten Altenkirch1 | ||
|
Summary: Indexed Containers Thorsten Altenkirch1 , Neil Ghani1 , Peter Hancock1 , Conor McBride1 , and Peter |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 31 | QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming | ||
|
Summary: QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming Thorsten Altenkirch 1 Jonathan... . [AG05] Thorsten Altenkirch and Jonathan Grattage. A functional quantum programming language... , normalisation 1 Introduction The functional quantum language QML was recently introduced by ... |
|||
|
Source: Sabry, Amr - Computer Science Department, Indiana University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 32 | QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming | ||
|
Summary: QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming Thorsten Altenkirch1 Jonathan... Workshop on Quantum Programming Languages, 2004. [AG05] Thorsten Altenkirch and Jonathan Grattage... , normalisation 1 Introduction The functional quantum language QML was recently introduced by ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 33 | QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming | ||
|
Summary: QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming Thorsten Altenkirch1 Jonathan... Workshop on Quantum Programming Languages, 2004. [AG05] Thorsten Altenkirch and Jonathan Grattage... , normalisation 1 Introduction The functional quantum language QML was recently introduced by ... |
|||
|
Source: Sabry, Amr - Computer Science Department, Indiana University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 34 | Constructing Strictly Positive Types Michael Abbott a , Thorsten Altenkirch b , Neil Ghani a | ||
|
Summary: Containers Constructing Strictly Positive Types Michael Abbott a , Thorsten Altenkirch b , Neil... , 2003. M. Abbott, T. Altenkirch, and N. Ghani. Categories of containers. In Proceedings of Foundations... . Abbott, T. Altenkirch, and N. Ghani. ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 35 | Categories of Containers Michael Abbott1, Thorsten Altenkirch2, and Neil Ghani1 | ||
|
Summary: Categories of Containers Michael Abbott1, Thorsten Altenkirch2, and Neil Ghani1 1 Department... 1. References M. Abbott, T. Altenkirch, N. Ghani, and C. McBride. Derivatives of containers. URL... (Altenkirch and McBride, 2002). An instance of this theme, the ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 36 | Categories of Containers Michael Abbott1, Thorsten Altenkirch2, and Neil Ghani1 | ||
|
Summary: Categories of Containers Michael Abbott1, Thorsten Altenkirch2, and Neil Ghani1 1 Department... . #12;References M. Abbott, T. Altenkirch, N. Ghani, and C. McBride. Derivatives of containers. URL http... (Altenkirch and McBride, 2002). An instance of this theme, the ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester; Hutton, Graham - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 37 | The Quantum IO Monad Thorsten Altenkirch and Alexander S. Green | ||
|
Summary: 1 The Quantum IO Monad Thorsten Altenkirch and Alexander S. Green School of Computer Science... and Altenkirch (2007, 2008); Swierstra (2008)). At the same 1 #12;2 Thorsten Altenkirch and Alexander S. Green... 's QNET framework and from #12;4 Thorsten ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 38 | QPL 2006 Preliminary Version From reversible to irreversible computations | ||
|
Summary: Computer Science and IT The University of Nottingham Nottingham, UK Thorsten Altenkirch2 Computer Science... URL: www.elsevier.nl/locate/entcs #12;Green and Altenkirch Our plan is to follow the physical idea... and Altenkirch denote homsets by FxCR a = FxCR (a, a). We also assume that FxCR has a strict ... |
|||
|
Source: Selinger, Peter - Faculties of Mathematics and Computer Science, Dalhousie University |
|||
|
Collection: Computer Technologies and Information Sciences ; Physics |
|||
| 39 | Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARLS | ||
|
Summary: is easy THORSTEN ALTENKIRCH School of Computer Science & Information Technology, University of Nottingham... metalanguage like Martin-L¨of's Type Theory. #12;-conversion 9 References Altenkirch, Thorsten. (1993... (ed), Typed lambda calculi and applications. LNCS 664. Altenkirch, ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 40 | From reversible to irreversible computations Alexander S. Green 1,2 | ||
|
Summary: and IT The University of Nottingham Nottingham, UK Thorsten Altenkirch 3 Computer Science and IT The University... .elsevier.nl/locate/entcs #12;Green and Altenkirch has been investigated by Bennet in his classical paper [Ben73], where he... . Since we are only interested in objects which can be generated from 2 #12;Green and ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 41 | Derivatives of Containers Michael Abbott 1 , Thorsten Altenkirch 2 , Neil Ghani 1 , and Conor McBride 3 | ||
|
Summary: Derivatives of Containers Michael Abbott 1 , Thorsten Altenkirch 2 , Neil Ghani 1 , and Conor Mc... such an explanation from a categorical perspective. Our categorical presentation of containers in Abbott, Altenkirch... and extend it to greatest fixpoints in further work. References M. ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 42 | Derivatives of Containers Michael Abbott1, Thorsten Altenkirch2, Neil Ghani1, and Conor McBride3 | ||
|
Summary: Derivatives of Containers Michael Abbott1, Thorsten Altenkirch2, Neil Ghani1, and Conor McBride3 1... such an explanation from a categorical perspective. Our categorical presentation of containers in Abbott, Altenkirch... and extend it to greatest fixpoints in further work. References M. ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 43 | Generic Programming for Dependent Types Constructing Strictly Positive Families | ||
|
Summary: Thorsten Altenkirch University of Nottingham, UK {pwm,txa}@cs.nott.ac.uk Abstract We begin by revisiting... the Epigram programmer full access to all datatypes definable in Epigram. References [1] M. Abbott, T... . Altenkirch, and N. Ghani. Containers - constructing strictly positive types. Theoretical ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 44 | Indexed Containers Thorsten Altenkirch Peter Morris | ||
|
Summary: Indexed Containers Thorsten Altenkirch Peter Morris University of Nottingham {txa... and Computation Structures, 2003. [2] M. Abbott, T. Altenkirch, and N. Ghani. Containers - con- structing strictly... of families or more generally telescopes or equivalently arrow categories. References [1] M. ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 45 | Electronic Notes in Theoretical Computer Science 44 No. 1 (2001) URL: http://www.elsevier.nl/locate/entcs/volume44.html 14 pages | ||
|
Summary: , and Thorsten Altenkirch b a Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3... was supported by EPSRC grant Structured Recursive Programming , and together with Thorsten Altenkirch by ESPRIT... by Elsevier Science B. V. #12; Gibbons, Hutton and ... |
|||
|
Source: Gibbons, Jeremy - Computing Laboratory, University of Oxford; Hutton, Graham - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 46 | Electronic Notes in Theoretical Computer Science 44 No. 1 (2001) URL: http://www.elsevier.nl/locate/entcs/volume44.html 14 pages | ||
|
Summary: , and Thorsten Altenkirch b a Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3... Structured Recursive Programming, and together with Thorsten Altenkirch by ESPRIT Working Group Applied... Science B. V. #12;Gibbons, Hutton and Altenkirch 2 Fold and ... |
|||
|
Source: Hutton, Graham - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 47 | QPL 2005 Preliminary Version An algebra of pure quantum programming | ||
|
Summary: QPL 2005 Preliminary Version An algebra of pure quantum programming Thorsten Altenkirch1 Jonathan... in Electronic Notes in Theoretical Computer Science URL: www.elsevier.nl/locate/entcs #12;Altenkirch, Grattage... the development for the quantum constructs. Section 7 concludes. 22 #12;Altenkirch, Grattage, ... |
|||
|
Source: Selinger, Peter - Faculties of Mathematics and Computer Science, Dalhousie University |
|||
|
Collection: Computer Technologies and Information Sciences ; Physics |
|||
| 48 | Monads Need Not Be Endofunctors Thorsten Altenkirch1 | ||
|
Summary: Monads Need Not Be Endofunctors Thorsten Altenkirch1 , James Chapman2 , and Tarmo Uustalu2 1 School... by evaluation for typed lambda calculus. In: Proc. PPDP '02. ACM Press (2002) 2637 18. Abbott, M., Altenkirch... k Lam Lam . This example was described as a relative monad by ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 49 | Tait in one big step Thorsten Altenkirch and James Chapman | ||
|
Summary: Tait in one big step Thorsten Altenkirch and James Chapman School of Computer Science, University... ] Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, and Phil Scott. Normalization by evaluation for typed... 310, 2001. [2] Thorsten Altenkirch, Martin Hofmann, and ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 50 | Normalization by Evaluation for 2 Thorsten Altenkirch1 | ||
|
Summary: Normalization by Evaluation for 2 Thorsten Altenkirch1 and Tarmo Uustalu2 1 School of Computer... are using are only approximations of their type-theoretic #12;262 Thorsten Altenkirch and Tarmo Uustalu... for ), defined by #12;264 Thorsten Altenkirch and Tarmo Uustalu ... |
|||
|
Source: Uustalu, Tarmo - Institute of Cybernetics, Tallinn Technical University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 51 | A Partial Type Checking Algorithm for Type : Type | ||
|
Summary: ur Informatik, LudwigsMaximiliansUniversitat Munchen Oettingenstr. 67, D80538 Munchen Thorsten Altenkirch... in Theoretical Computer Science URL: www.elsevier.nl/locate/entcs #12; Abel, Altenkirch because of an error... , Altenkirch infinite set of variable identifiers. Exp # t, u, A, B, C, s ::= ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 52 | A Partial Type Checking Algorithm for Type : Type | ||
|
Summary: ¨ur Informatik, Ludwigs-Maximilians-Universit¨at M¨unchen Oettingenstr. 67, D-80538 M¨unchen Thorsten Altenkirch1... .elsevier.nl/locate/entcs #12;Abel, Altenkirch because of an error in the algorithm is excluded. Hence, for a given PTS... , types A, B, C, and sorts s. Metavariable x ranges over a countably 2 #12;Abel, ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 53 | A Partial Type Checking Algorithm for Type : Type | ||
|
Summary: ¨ur Informatik, Ludwigs-Maximilians-Universit¨at M¨unchen Oettingenstr. 67, D-80538 M¨unchen Thorsten Altenkirch1... Computer Science URL: www.elsevier.nl/locate/entcs #12;Abel, Altenkirch because of an error... . Metavariable x ranges over a countably 2 #12;Abel, Altenkirch infinite set of variable ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 54 | Categories of Containers Michael Abbott 1 , Thorsten Altenkirch 2 , and Neil Ghani 1 | ||
|
Summary: Categories of Containers Michael Abbott 1 , Thorsten Altenkirch 2 , and Neil Ghani 1 1 Department... + 1. #12; References M. Abbott, T. Altenkirch, N. Ghani, and C. McBride. Derivatives of containers... (Altenkirch and McBride, 2002). An instance of this theme, the ... |
|||
|
Source: Abbott, Michael - Department of Computer Science, University of Leicester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 55 | New Jersey Institute of Technology University Heights | ||
|
Summary: .624.2541 fax altenkirch@njit.edu watkins@njit.edu Robert A. Altenkirch President May 14, 2008 The Consulate... of such devastation. Sincerely, Robert A. Altenkirch, President New Jersey Institute of Technology #12; |
|||
|
Source: New Jersey Institute of Technology, Center for Solar-Terrestrial Research |
|||
|
Collection: Physics |
|||
| 56 | : Dependent Types without the Sugar Thorsten Altenkirch1 | ||
|
Summary: : Dependent Types without the Sugar Thorsten Altenkirch1 , Nils Anders Danielsson1 , Andres L¨oh2... -soundness: -reduction does not get stuck for closed, well-typed programs. #12;References Thorsten Altenkirch and Nicolas... Oury. : A core language for dependently typed programming. Draft, 2008. ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham; Löh, Andres - Department of Information and Computing Sciences, Universiteit Utrecht |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 57 | Constructing Strictly Positive Families Peter Morris and Thorsten Altenkirch | ||
|
Summary: Constructing Strictly Positive Families Peter Morris and Thorsten Altenkirch School of Computer... Positive Families REFERENCES [1] Michael Abott, Thorsten Altenkirch, and Neil Ghani. Containers... : Selected Topics. [2] Michael Abott, Thorsten Altenkirch, Neil Ghani, ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 58 | Derivatives of Containers Michael Abbott 1 , Thorsten Altenkirch 2 , Neil Ghani 1 , and Conor McBride 3 | ||
|
Summary: Derivatives of Containers Michael Abbott 1 , Thorsten Altenkirch 2 , Neil Ghani 1 , and Conor Mc... such an explanation from a categorical perspective. Our categorical presentation of containers in Abbott, Altenkirch... in further work. References M. Abbott, T. ... |
|||
|
Source: Ghani, Neil - Department of Computer and Information Sciences, University of Strathclyde |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 59 | Derivatives of Containers Michael Abbott1, Thorsten Altenkirch2, Neil Ghani1, and Conor McBride3 | ||
|
Summary: Derivatives of Containers Michael Abbott1, Thorsten Altenkirch2, Neil Ghani1, and Conor McBride3 1... presentation of containers in Abbott, Altenkirch, and Ghani (2003) provides the key to the mystery. We now... . References M. Abbott, T. ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 60 | Curriculum Vitae Full name: Andreas Martin Abel | ||
|
Summary: procedure [3]. Finally, Thorsten Altenkirch and I* * gave a predicative normalization proof for the simply... , Ludwig-Maximilians-University Munich, 1999. [2] Andreas Abel and Thorsten Altenkirch. A predicative... in Computer Science, pages 1-20. Springe* *r, 2000. [4] Andreas Abel and ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 61 | Under consideration for publication in J. Functional Programming 1 Big-Step Normalisation | ||
|
Summary: , Estonia: The British Computer Society (BCS). Altenkirch, Thorsten, Hofmann, Martin, & Streicher, Thomas... . Altenkirch, Thorsten, Dybjer, Peter, Hofmann, Martin, & Scott, Phil. (2001). Normaliza- tion by evaluation... Under consideration for publication in J. Functional Programming 1 Big-Step ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 62 | Termination Checking = Type Checking Structural Recursion beyond Subterm Ordering | ||
|
Summary: ;ez, 1998]. Slide 12 References [1] Andreas Abel and Thorsten Altenkirch. A predicative analysis... ; Mutual recursion [Abel/Altenkirch, 2001] , [Lee/Jones/Ben-Amram, 2001]. #15; Coinductive types [Gimen#19 |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 63 | Math. Struct. in Comp. Science Structuring Quantum Effects | ||
|
Summary: VIZZOTTO1 , THORSTEN ALTENKIRCH2 and AMR SABRY3 1 Institute of Informatics, Federal University of Rio... . Vizzotto, T. Altenkirch and A. Sabry 2 effects within the context of a pure functional language. Since... programming language QML (Altenkirch and Grattage 2005). Section 8 concludes. The entire Haskell ... |
|||
|
Source: Sabry, Amr - Computer Science Department, Indiana University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 64 | A Finitary Version of System F Thorsten Altenkirch and Thierry Coquand | ||
|
Summary: A Finitary Version of System F Thorsten Altenkirch and Thierry Coquand May 16, 2001 #12; System F |
|||
|
Source: Coquand, Thierry - Department of Computer Science and Engineering, Chalmers University of Technology |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 65 | PROCEEDINGS OF THE IFIP TC2 WORKING CONFERENCE ON | ||
|
Summary: Thorsten Altenkirch, Conor McBride Generic Haskell, Specifically 21 Dave Clarke, Andres L¨oh Generic |
|||
|
Source: Gibbons, Jeremy - Computing Laboratory, University of Oxford |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 66 | From: Bulletin <not-for-reply@njit.edu> Date: September 21, 2011 1:35:35 PM EDT | ||
|
Summary: : Resignation of President Altenkirch MEMORANDUM To: The NJIT Community From: Kathleen Wielkopolski, NJIT Board... of Trustees Date: Wednesday, September 21, 2011 RE: Resignation of President Altenkirch The New Jersey... . Altenkirch. We congratulate him on being named President of the University of Alabama in Huntsville and thank |
|||
|
Source: New Jersey Institute of Technology, Center for Solar-Terrestrial Research |
|||
|
Collection: Physics |
|||
| 67 | A Few Constructions on Constructors Conor McBride1 | ||
|
Summary: . Michael Abbott, Thorsten Altenkirch, Neil Ghani, and Conor McBride. for data: derivatives of data... structures. Fundamenta Informaticae, 2005. 2. Thorsten Altenkirch and Conor McBride. Generic programming... . It is similar in character to the Altenkirch-Streicher ... |
|||
|
Source: St Andrews, University of - School of Mathematics and Statistics, Centre for Interdisciplinary Research in Computational Algebra |
|||
|
Collection: Mathematics |
|||
| 68 | MSFP 2008 A Partial Type Checking Algorithm for | ||
|
Summary: "unchen Thorsten Altenkirch1 ,2 ,4 School of Computer Science, The University of Nottingham... URL: www.elsevier.nl/locate/entcs #12; Abel, Altenkirch because... #12; Abel, Altenkirch ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 69 | Math. Struct. in Comp. Science Structuring Quantum E#ects | ||
|
Summary: ZZOTTO 1 , THORSTEN ALTENK I RCH 2 and AMR SABRY 3 1 Institute of Informatics, Federal University of Rio... . Vizzotto, T. Altenkirch and A. Sabry 2 e#ects within the context of a pure functional language. Since... programming language QML (Altenkirch and Grattage 2005). Section 8 concludes. The entire Haskell code |
|||
|
Source: Sabry, Amr - Computer Science Department, Indiana University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 70 | Types for Proofs and Programs Coordination Action | ||
|
Summary: Bove from Chalmers, Milad Niqui from Nijmegen, Thorsten Altenkirch from Nottingham, and Pietro di... induction and weakly final coalgebras in dependent type theory (Extended version). 30 pages. T. Altenkirch |
|||
|
Source: Nordström, Bengt - Department of Computer Science and Engineering, Chalmers University of Technology |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 71 | Constructive membership predicates as index James Caldwell | ||
|
Summary: , 2003. [2] Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Containers: Con- structing strictly... University, 2001. www.cs.cornell.edu/Info/People/sfa/Nuprl/NuprlPrimitives/. [4] Thorsten Altenkirch, Neil... for their comments. References [1] Michael Abbott. ... |
|||
|
Source: Caldwell, James - Department of Computer Science, University of Wyoming |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 72 | Observational Equality, Now! Thorsten Altenkirch Conor McBride Wouter Swierstra | ||
|
Summary: Observational Equality, Now! Thorsten Altenkirch Conor McBride Wouter Swierstra University... difficulties. Altenkirch's setoid model [4] gets around these problems: his meta-logic has a more liberal... variant of the theory for which Altenkirch constructed a setoid model. The consequent simplification |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 73 | Termination of Mutually Recursive Functions Andreas Abel | ||
|
Summary: and Thorsten Altenkirch. A predicative analysis of structural recursion. Submitted to the Journal of Functional... Project 1996 Munich Type Theory Implementation (T. Altenkirch) 1998 Implementation of termination checker |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 74 | Subtyping, Declaratively An Exercise in Mixed Induction and Coinduction | ||
|
Summary: and Thorsten Altenkirch University of Nottingham Abstract. It is natural to present subtyping for recursive... 4807 of LNCS, pages 286301, 2009. Andreas Abel and Thorsten Altenkirch. A predicative analysis... . Nils Anders Danielsson and Thorsten Altenkirch. Mixing ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 75 | From High School to University Algebra Thorsten Altenkirch | ||
|
Summary: From High School to University Algebra Thorsten Altenkirch 1 Introduction Wilkie showed... types with strong sums (e.g. Altenkirch et al) to dependent types. Adding 0 would make the theory |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 76 | Normalization by Evaluation for System F Andreas Abel | ||
|
Summary: . Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher. Reduction-free normalisation for a polymorphic... dependent type theories. Goal: tackle impredicativity. Altenkirch, Hofmann, and Streicher described Nb |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 77 | Strong Normalization for Equi-(Co-)Inductive Types Andreas Abel | ||
|
Summary: : Stream Processor example communicated to me by Thorsten Altenkirch and Conor McBride. Guardedness idea... (Altenkirch [9399], Barthe et al.[0106], Geuvers [92], Giménez, Matthes [98], Mendler [87-91]; CIC). Notable |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 78 | Wellfounded Trees and Dependent Polynomial Functors | ||
|
Summary: Peter Aczel, Thorsten Altenkirch, Benno van den Berg, Marcelo Fiore and Erik Palmgren for stimulating... . Ph.D. thesis, University of Leicester (2003). 2. Abbott, M., Altenkirch, T., Ghani, N.: Categories... . The free monad on a polynomial functor is polynomial. References 1. Abbott, M.: ... |
|||
|
Source: Gambino, Nicola - Department of Computer Science, University of Leicester |
|||
|
Collection: Mathematics |
|||
| 79 | Weak ##Normalization and Normalization by Evaluation for System F | ||
|
Summary: 29--56. SpringerVerlag, 2008. [ADHS01] Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, and Philip... , 2001. [AHS96] Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher. Reduction free normalisation... --106. IEEE Com puter Soc. Press, 1996. [AHS97] Thorsten ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 80 | Weak -Normalization and Normalization by Evaluation for System F | ||
|
Summary: 56. Springer-Verlag, 2008. [ADHS01] Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, and Philip J. Scott... in Computer Science (LICS 2001), pages 303310. IEEE Computer Soc. Press, 2001. [AHS96] Thorsten Altenkirch... , 1996. [AHS97] Thorsten Altenkirch, Martin ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 81 | Lifting Grothendieck Universes Martin HOFMANN, Thomas STREICHER | ||
|
Summary: of a discrete #12;bration P over C # I are in canonical correspon- dance with P (id I ). References [1] Thorsten... Altenkirch, Martin Hofmann, and Thomas Streicher. Reduction-free normalisation for a polymorphic system |
|||
|
Source: Streicher, Thomas - Department of Mathematics, Technische Universität Darmstadt |
|||
|
Collection: Mathematics |
|||
| 82 | Termination of Functions that Are Passed to Their Arguments | ||
|
Summary: Technical discussions on my thesis: Klaus Aehlig Thorsten Altenkirch |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 83 | Termination of Functions that Are Passed to Their Arguments | ||
|
Summary: #12; Slide 15 Acknowledgements . Technical discussions on my thesis: Klaus Aehlig Thorsten Altenkirch |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 84 | On Extensions to Definitional Equality in Agda Or: Making Agda See More | ||
|
Summary: rewrite, apply it to old rewrites. Implemented prototypically in MiniAgda and old PiSigma (Thorsten... Altenkirch, Nicolas Oury). Termination? Completeness? Andreas Abel (LMU Munich) Definitional Equality AIM-10 |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 85 | Termination of Functions that Are Passed to Their Arguments | ||
|
Summary: #12;Slide 15 Acknowledgements · Technical discussions on my thesis: Klaus Aehlig Thorsten Altenkirch |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 86 | (Co-)Iteration for Higher-Order Nested Datatypes | ||
|
Summary: on syntactic Kan extensions and the representation of substitution and to Thorsten Altenkirch for his valuable... for . 9 #12; Example 6(Functions over binary trees). Thorsten Altenkirch [Alt01] shows how to encode... 's homepage, 2003. [Alt01] ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 87 | (Co-)Iteration for Higher-Order Nested Datatypes | ||
|
Summary: and to Thorsten Altenkirch for his valuable feedback on early versions of the present article. We also thank... ;Example 6 (Functions over binary trees). Thorsten Altenkirch [Alt01] shows how to encode functions over... code accompanying this article, available on the author's homepage, 2003. [Alt01] ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 88 | Under consideration for publication in Math. Struct. in Comp. Science Relative monads formalised | ||
|
Summary: THORSTEN ALTENKIRCH1 , JAMES CHAPMAN2 and TARMO UUSTALU2 § 1 School of Computer Science, University... running examples from programming theory. 1 Introduction Relative monads (Altenkirch, Chapman, and Uustalu... . T. Altenkirch was supported by the Engineering and Physical Sciences Research Council (EPSRC) ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 89 | Towards Observational Type Theory Thorsten Altenkirch and Conor McBride | ||
|
Summary: Towards Observational Type Theory Thorsten Altenkirch and Conor McBride School of Computer Science... ] M. Abbott, T. Altenkirch, and N. Ghani. Containers - con- structing strictly positive types... . Theoretical Computer Sci- ence, 342:327, September 2005. [2] T. Altenkirch. Extensional ... |
|||
|
Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 90 | A Categorical Semantics for Inductive-Inductive Definitions | ||
|
Summary: A Categorical Semantics for Inductive-Inductive Definitions Thorsten Altenkirch1,, Peter Morris1... is equivalent. References 1. Abbott, M., Altenkirch, T., Ghani, N.: Containers: Constructing strictly positive... types. Theoretical Computer Science 342(1), 3 27 (2005) 2. Altenkirch, ... |
|||
|
Source: Setzer, Anton - Department of Computer Science, University of Wales Swansea |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 91 | Termination of Mutually Recursive Functions Andreas Abel | ||
|
Summary: ; Slide 22 References [AA99] Andreas Abel and Thorsten Altenkirch. A predicative... _foetus_Project________________________________________________ 1996 Munich Type Theory Implementation (T. Altenkirch) 1998 Implementation of termination |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 92 | Termination of Mutually Recursive Functions Andreas Abel | ||
|
Summary: ] Andreas Abel and Thorsten Altenkirch. A predicative analysis of structural recursion. Submitted... =) invalid proofs possible! Slide 4 The foetus Project 1996 Munich Type Theory Implementation (T. Altenkirch |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 93 | Slide 1 TOPOLOGY Slide 2 TOPOLOGY | ||
|
Summary: and Thorsten Altenkirch. A predicative analysis of structural recursion. Journal of Functional Programming, 12... 1992 [3], Gimenez 1994 [4], Abel/Altenkirch [2]) · By type-checking Slide 6 Inductive Datatypes · E |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 94 | Is ZF a hack? Comparing the complexity of some | ||
|
Summary: Automath function in the terms. Thorsten Altenkirch explained to me that addition of such a function... : After Thorsten Altenkirch read this paper his reaction was: I can't help making the obvious comment... of a hack than ZF. Acknowledgments. Thanks to Thorsten ... |
|||
|
Source: Wiedijk, Freek - Institute for Computing and Information Sciences, Radboud Universiteit Nijmegen |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 95 | Is ZF a hack? Comparing the complexity of some | ||
|
Summary: an explicit Automath function in the terms. Thorsten Altenkirch explained to me that addition... !) A reader comments: After Thorsten Altenkirch read this paper his reaction was: I can't help making... . For the record: I agree with Thorsten that simple and short are not the same thing. (I ... |
|||
|
Source: Wiedijk, Freek - Institute for Computing and Information Sciences, Radboud Universiteit Nijmegen |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 96 | Is ZF a hack? Comparing the complexity of some | ||
|
Summary: an explicit Automath function in the terms. Thorsten Altenkirch explained to me that addition... !) A reader comments: After Thorsten Altenkirch read this paper his reaction was: I can't help making... . For the record: I agree with Thorsten that simple and short are not the same thing. (I ... |
|||
|
Source: Wiedijk, Freek - Institute for Computing and Information Sciences, Radboud Universiteit Nijmegen |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 97 | Type-Based Termination and Productivity Checking | ||
|
Summary: _______________________________________ fflTechnical discussions on my thesis: Klaus Aehlig Thorsten Altenkirch Martin... A predicative analysis of structural recursion (with Altenkirch, JFP, 2002) Slide 42 ffl... normalization proof for a ~-calculus with ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 98 | TypeBased Termination and Productivity Checking | ||
|
Summary: Acknowledgements . Technical discussions on my thesis: Klaus Aehlig Thorsten Altenkirch Martin Hofmann John Hughes... ) . A predicative analysis of structural recursion (with Altenkirch, JFP, 2002) . Termination and guardedness... inductive types (Abel, Altenkirch, TYPES'99) . Co(iteration) for higherorder ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 99 | Type-Based Termination and Productivity Checking | ||
|
Summary: recursion (with Altenkirch, JFP, 2002) · Termination and guardedness checking with continuous types (TLCA'03... strong normalization proof for a -calculus with interleaving inductive types (Abel, Altenkirch, TYPES'99... ). 24 #12;Slide 49 Acknowledgements · Technical discussions on my thesis: Klaus Aehlig Thorsten |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 100 | Under consideration for publication in J. Functional Programming 1 A Predicative Analysis of Structural Recursion | ||
|
Summary: @tcs.informatik.uni-muenchen.de) THORSTEN ALTENKIRCH School of Computer Science & Information Technology, University of Notting* *ham... University. #12; 2 A. Abel and T. Altenkirch datatype Nat = O | S of Nat... , 1999), section 7.2. #12; 4 ... |
|||
|
Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||