Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer programming --- -Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Problems, exercises, etc --- Programming --- -Problems, exercises, etc --- Computers --- Recursivity --- Network --- Statistics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"Reinventing Bankruptcy Law explodes conventional wisdom about the history of the Companies' Creditors Arrangement Act and in its place offers the first historical account of Canada's premier corporate restructuring statute. The book adopts a novel research approach that combines legal history, socio-legal theory, ideas from political science, and doctrinal legal analysis. Meticulously researched and multi-disciplinary, Reinventing Bankruptcy Law provides a comprehensive and concise history of CCAA law over the course of the twentieth century, framing developments within broader changes in Canadian institutions including federalism, judicial review, and statutory interpretation. Examining the influence of private parties and commercial practices on lawmaking, Virginia Torrie argues that CCAA law was shaped by the commercial needs of powerful creditors to restructure corporate borrowers, providing a compelling thesis about the dynamics of legal change in the context of corporate restructuring. Torrie exposes the errors in recent case law to devastating effect and argues that courts and the legislature have switched roles. This book is essential reading for the Canadian insolvency community as well as those interested in Canadian institutions, legal history, and the dynamics of change."--

Bankruptcy --- History. --- Canada. --- Companies' Creditors Arrangement Act (Canada) --- CCAA. --- bankruptcy and insolvency. --- bankruptcy. --- companies’ creditors arrangement act. --- corporate insolvency. --- corporate law. --- corporate restructuring. --- history of bankruptcy in Canada. --- insolvency. --- recursivity of law.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Mathematical logic --- Recursive functions --- Fonctions récursives --- Recursive Functions --- 510.6 --- Functions, Recursive --- Algorithms --- Arithmetic --- Logic, Symbolic and mathematical --- Number theory --- Recursion theory --- Decidability (Mathematical logic) --- Foundations --- Recursive functions. --- 510.6 Mathematical logic --- Logique mathématique --- Récursivité, Théorie de la --- Recursivity

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Pascal (Computer program language) --- Computer programming --- 681.3*A1 --- 681.3*D1 --- 681.3*D32 --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Programming languages (Electronic computers) --- Introductory and survey --- Programming techniques--See also {681.3*E} --- language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- 681.3*D32 language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- 681.3*D1 Programming techniques--See also {681.3*E} --- 681.3*A1 Introductory and survey --- Data structures --- Recursivity --- Pascal (langage de programmation) --- Programming Language

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*F31 --- 681.3*F33 --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- Studies of program constructs: control primitives; functional constructs; program and recursion schemes; type structure (Logics and meanings of programs)-- See also {681.3*D32}; {681.3*D33} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F33 Studies of program constructs: control primitives; functional constructs; program and recursion schemes; type structure (Logics and meanings of programs)-- See also {681.3*D32}; {681.3*D33} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- Computer programming --- Induction (Mathematics) --- Recursion theory --- 681.3*I1 --- 681.3*I23 --- 681.3*I1 Algebraic manipulation (Computing methodologies) --- Algebraic manipulation (Computing methodologies) --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Logic, Symbolic and mathematical --- Mathematical induction --- Induction (Logic) --- Mathematics --- Programming --- Computer programming. --- Induction (Mathematics). --- Recursion theory. --- Informatique --- Computer science --- Recursivity --- proof --- Induction